Data streamer

ABSTRACT

In an information processing system which has plurality of modules including a processor, a main memory and a plurality of I/O devices, a data transfer switch for performing data transfer operations between the processor, main memory and I/O devices comprises a request bus which has a request bus arbiter for receiving read and write requests from each one of the plurality of modules. A processor memory bus is configured to receive address and data information from a predetermined number of modules, including the processor. The processor memory bus has a data bus arbiter for receiving data read and write requests from each one of the predetermined number of modules which are coupled to the processor memory bus. An internal memory bus is configured to receive address and data information from a predetermined number of modules, including the memory and the I/O devices. The internal memory bus has a data bus arbiter for receiving data read and write requests from each one of the predetermined number of modules coupled to the internal memory bus. A transceiver system is coupled to the processor memory bus and the internal memory bus for transferring data between the processor memory bus and the internal memory bus.

RELATING APPLICATIONS

This is a continuation of copending application Ser. No. 09/710,192filed on Oct. 11, 2000, which in turn is a divisional of applicationSer. No. 09/173,297 filed on Oct. 14, 1998. Applicant claims the benefitof the earlier filed U.S. Patent Applications under 35 USC 120.

FIELD OF THE INVENTION

The present invention relates to a data processor, and more specificallyto a data transfer arrangement mechanism employed to transfer data tovarious components of the data processor.

BACKGROUND OF THE INVENTION

In many data processing chip sets data is transferred from one ore manyprocessors to memory devices and input/output, I/O, subsystems, or otherchip components known as functional units, via an appropriate busstructure. Typically, the bus structure includes a processor bus, asystem bus and a memory bus. Thus, when there is a memory operationwherein data is required to be moved to or from a memory location to aprocessor, the system bus would cease to operate until the data movementfrom the memory location to the processor is completed. Similarly, whenthere is a data movement from an external device to a memory location,the processor bus would cease to operate until the data is moved to itsintended location.

In order to alleviate the under utilization of bus subsystems asdescribed above, U.S. Pat. No. 5,668,965 issued on September 16, 19997,teaches the use of a controller that forms a three-way connection ofthree kinds of buses including a processor bus linked to at least oneprocessor, a memory bus connected to a main memory, and a system buslinked to at least one connected device such as an input/output, I/O,device, thereby establishing interconnections between carious buses. Thecontroller includes data path switch means for transferring controlsignals and addresses through the control and address buses respectivelyof the three kinds of buses, and for generating a data path controlsignal to be supplied to the data switch means.

This arrangement allows the use of the buses on an independent basis.For example, when a processor on the processor bus conducts aprocessor/main memory access to access the main memory on the memorybus, data is transferred only via the processor and memory buses,allowing the system bus to operate independently.

However, the arrangement disclosed in the '965 patent does not providefor a priority based data movement. Furthermore, it does not disclose amechanism to handle data transfers between endpoints that exhibitmismatched bandwidth requirements.

Additionally, conventional data movement arrangements have failed toaddress application-specific requirements. For example, when a dataprocessor is employed for handling graphical images and displaying themon a screen, considerable throughput efficiency may be gained by takinginto account the memory address patterns that are inherent with suchgraphical images.

Another disadvantage with conventional systems is that the resourcesemployed by the data movement arrangements cannot be flexibly specifiedbased on a corresponding data transfer between two end points. Forexample, some data movement arrangements employ fixed buffers toaccommodate separate input/output, I/O, data transfers.

Thus, there is a need for a data movement arrangement that overcomes theadvantages discussed above, and specifically accommodates data transfersfor an integrated media processor chip set that contains various systemcomponents such as processors, data cache, three dimensional graphicsunits, memory and input/output devices.

SUMMARY OF THE INVENTION

In accordance with one embodiment of the invention, an informationprocessing system includes a plurality of modules including a processor,a data cache memory, a main memory and a plurality of I/O devices. Adata transfer switch is provided to handle a plurality of data transferoperations simultaneously on a priority based scheduling. A split levelbus allows for such simultaneous data transfer operations between theprocessor, main memory and I/O devices. The split level bus comprises afirst request bus having a request bus arbiter for receiving read andwrite requests from each one of said plurality of modules.

A processor memory bus is configured to receive address and datainformation from a predetermined number of said modules including saidprocessor. The processor memory bus includes a data bus arbiter forreceiving data read and write requests from each one of thepredetermined number of modules coupled to it. Furthermore, an internalmemory bus is configured to receive address and data information from apredetermined number of the modules including the memory and I/Odevices. The memory bus has a data bus arbiter for receiving data readand write requests from each one of the predetermined number of modulescoupled to the internal memory bus.

For data transfers that originate from a module coupled to one of thedata buses and is intended for a module that is coupled to the otherdata bus a transceiver system is employed which is coupled to bothprocessor memory bus and the internal memory bus for transferring databetween the two data buses.

In accordance with another embodiment of the invention, the request busarbiter is configured to receive a plurality of read and write requestseach having a specifiable priority level, wherein the requests areserved in a descending order of priority.

In accordance with yet another embodiment of the invention, a datastreamer is employed in the information processing system, which allowsfor simultaneous data transfers between modules that may have disparatedata transfer rates. The data streamer comprises a channel state memoryconfigured to store a first allocated channel information correspondingto a data transfer operation from a source module to the data streamer.The channel state memory is further configured to store a secondallocated channel information corresponding to the data transferoperation from the data streamer to a destination module. The datastreamer further includes a buffer memory allocated to the data transferoperation for receiving data provided by the source module in accordancewith the first allocated channel information and providing the receiveddata to the destination module in accordance with the second allocatedchannel information.

In accordance with another embodiment of the invention, the channelstate memory stores information corresponding to a plurality of datatransfer operations between the modules. Furthermore, a buffer memory isallocated for each one of the data transfer operations and the size ofthe buffer memory variably changes in accordance with the size of datain a corresponding data transfer operation.

In accordance with yet another embodiment of the invention, the datatransfer operations occur in accordance with a program referred to as achannel descriptor. Thus, transfers to the buffer memory occur inaccordance with a corresponding channel descriptor, as well as transfersfrom buffer memory to a destination module occur in accordance with acorresponding channel descriptor.

The data streamer also conducts a data cache operation with its datatransfer operations for a data cache having a coherent allocationpolicy. The data streamer may also conduct the data cache operation fora data cache having a coherent no-allocation policy, or having anon-coherent no-allocation policy.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter regarded as the invention is particularly pointed outand distinctly claimed in the concluding portion of the specification.The invention, however, both as to organization and method of operation,together with features, objects, and advantages thereof may best beunderstood by reference to the following detailed description when readwith the accompanying drawings in which:

FIG. 1(a) is a block diagram of a multimedia processor system inaccordance with one embodiment of the present invention;

FIG. 1(b) is a block diagram of an input/output (I/O) unit of themultimedia processor system illustrated in FIG. 1(a);

FIG. 1(c) is a block diagram of a multimedia system employing amultimedia processor in conjunction with a host computer, in accordancewith one embodiment of the invention.

FIG. 1(d) is a block diagram of a stand-alone multimedia systememploying a multimedia processor in accordance with one embodiment ofthe invention.

FIG. 2 is a flow chart illustrating a data transfer request operation inconjunction with a data transfer switch in accordance with oneembodiment of the invention.

FIGS. 3 (a) and 3(b) is a flow chart illustrating a read transactionthat employs a data transfer switch in accordance with one embodiment ofthe invention.

FIGS. 4(a) and 4(b) illustrate the flow of signals during a request busconnection and an internal memory bus connection in accordance with oneembodiment of the invention.

FIG. 5(a) illustrates the timing diagram for a request bus readoperation, in accordance with one embodiment of the present invention.

FIG. 5(b) illustrates the timing diagram for a read request where thegrant is not given immediately, in accordance with one embodiment of theinvention.

FIG. 5(c) illustrates the timing diagram for a request bus writeoperation, in accordance with one embodiment of the invention.

FIG. 5(d) illustrates the timing diagram for a data bus transferoperation, in accordance with one embodiment of the invention.

FIG. 6(a) illustrates a timing diagram for a request bus master making aback-to-back read request.

FIG. 6(b) illustrates a timing diagram for a processor memory bus mastermaking a back-to-back request, when grant is not immediately granted forthe second request.

FIG. 6(c) illustrates a timing diagram for a request bus slave receivinga read request followed by a write request.

FIG. 7 illustrates a block diagram of a data streamer in accordance withone embodiment of the invention.

FIG. 8 illustrates a block diagram of a transfer engine employed in adata streamer in accordance with one embodiment of the invention.

FIG. 9 is a block diagram of a data transfer switch in accordance withone embodiment of the invention.

FIG. 10 is a block diagram of a data steamer buffer controller inaccordance with one embodiment of the invention.

FIG. 11 is a block diagram of a direct memory access controller inaccordance with one embodiment of the invention.

FIG. 12 is an exemplary memory address space employed in accordance withone embodiment of the invention.

FIG. 13 illustrates a data structure for a channel descriptor inaccordance with one embodiment of the invention.

FIG. 14 illustrates a data structure for a channel descriptor inaccordance with another embodiment of the invention.

FIGS. 15(a)-15(c) illustrate a flow chart for setting a data path inaccordance with one embodiment of the invention.

FIG. 16 illustrates a block diagram of a prior art cache memory system.

FIG. 17 illustrates a block diagram of a cache memory system inaccordance with one embodiment of the present invention.

FIG. 18 is a flow chart illustrating the operation of a prior art cachememory system.

FIG. 19 is a flow chart illustrating the operation of a cache memorysystem in accordance with one embodiment of the invention.

FIG. 20 is a block diagram of a fixed function unit in conjunction witha data cache in a multimedia processor in accordance with one embodimentof the invention.

FIG. 21 is a block diagram of a 3D triangle rasterizer in a binning modein accordance with one embodiment of the invention.

FIG. 22 is a block diagram of a 3D triangle rasterizer in interpolationmode in accordance with one embodiment of the invention.

FIG. 23 is a block diagram of a 3D texture controller in accordance withone embodiment of the invention.

FIG. 24 is a block diagram of a 3D texture filter in accordance with oneembodiment of the invention.

FIGS. 25(a) and 25(b) are block diagrams of a video scaler in accordancewith one embodiment of the invention.

FIG. 26 is a plot of a triangle subjected to a binning process inaccordance with one embodiment of the invention.

FIG. 27 is a flow chart illustrating the process for implementing 3Dgraphics in accordance with one embodiment of the invention.

DETAILED DESCRIPTION OF THE DRAWINGS

In accordance with one embodiment of the present invention, a multimediaprocessor 100 is illustrated in FIG. 1, although the invention is notlimited in scope in that respect. Multimedia processor 100 is a fullyprogrammable single chip that handles concurrent operations. Theseoperations may include acceleration of graphics, audio, video,telecommunications, networking and other multimedia functions. Becauseall the main components of processor 100 are disposed on one chip set,the throughput of the system is remarkably better than those of theconventional systems as will be explained in more detail below.

Multimedia processor 100 includes a very-long instruction word (VLIW)processor that is usable in both hosted and hostless environment. Withinthe present context a hosted environment is one where multimediaprocessor 100 is coupled to a separate microprocessor such as INTEL®X-86, and a hostless environment is one which multimedia processor 100functions as a stand-alone module. The VLIW processor is denoted ascentral processing unit having two clusters CPU 102 and CPU 104. Theseprocessing units 102 and 104 respectively allow multimedia processor100, in accordance with one embodiment of the invention, operate as astand-alone chip set.

The operation of the VLIW processor is well-known and described in JohnR. Ellis, Bulldog: A Compiler for VLIW Architectures, (The MIT Press,1986) and incorporated herein by reference. Basically, a VLIW processoremploys an architecture which is suitable for exploitinginstruction-level parallelism (ILP) in programs. This arrangement allowsfor the execution of more than one basic (primitive) instruction at atime. These processors contain multiple functional units, that fetchfrom an instruction cache a very-long instruction word containingseveral primitive instructions, so that the instructions may be executedin parallel. For this purpose, special compilers are employed whichgenerate code that has grouped together independent primitiveinstructions—executable in parallel. In contrast to superscalarprocessor, VLIW processors have relatively simple control logic, becausethey do not perform any dynamic scheduling nor reordering of operations.VLIW processors have been described as a successor to RISC, because theVLIW compiler undertakes the complexity that was imbedded in thehardware structure of the prior processors The instruction set for aVLIW architecture tends to consist of simple instructions. The compilermust assemble many primitive operations into a single “instruction word”such that the multiple functional units are kept busy, which requiresenough instruction-level parallelism (ILP) in a code sequence to fillthe available operation slots. Such parallelism is uncovered by thecompiler, among other thins, through scheduling code speculativelyacross basic blocks, performing software pipelining, and reducing numberof operations executed.

An output port of VLIW processor 102 is coupled to a data cache 108.Similarly, an output port of VLIW processor 104 is coupled to aninstruction cache 110. Output ports of data cache 108 and instructioncache 110 are in turn coupled to input ports of a data transfer switch112 in accordance with one embodiment of the present invention.Furthermore, a fixed function unit 106 is disposed in multimediaprocessor 100 to handle three dimensional graphical processing as willbe explained in more detail. Output ports of fixed function unit 106 arealso coupled to input ports of data transfer switch 112, as illustratedin FIG. 1. Fixed function unit 106 is also coupled to an input port ofdata cache 108. The arrangement and operation of the fixed function unitin conjunction with the data cache is described in more detail inreference with FIGS. 20-26. The arrangement and the operation of datacache 108 in accordance with one embodiment of the invention isdescribed in more detail below in reference with FIGS. 17 and 19.

As illustrated in FIG. 1(a), all of the components of multimediaprocessor 100 are coupled to data transfer switch 112. To this end,various ports of memory controller 124 are coupled to data transferswitch 112. Memory controller 124 controls the operation of an externalmemory, such as SDRAM 128. Data transfer switch 112 is also coupled to adata streamer 122. As will be explained in more detail below, datastreamer 122 provides buffered data movements within multimediaprocessor 100. It further supports data transfer between memory orinput/output I/O devices that have varying bandwidth requirements. Inaccordance with one embodiment of the present invention, memory deviceshandled by data streamer 122 may include any physical memory within thesystem that can be addressed, including external SDRAM 128, data cache108, and memory space located in fixed function unit 106.

Furthermore, data streamer 122 handles memory transfers to host memoryin situations where multimedia processor 100 is coupled to a hostprocessor via a PCI bus as described in more detail below in referencewith FIG. 1(c). To this end, multimedia processor 100 also includes aPCI/AGP interface 130, having ports that are coupled to data transferswitch 112. PCI/AGP interface 130 allows multimedia processor 100communicate with a corresponding PCI bus and AGP bus that employstandard protocols respectively known as PCI Architecture SpecificationRev. 2.1 (published by the PCI Special Interest Group), and incorporatedherein by reference, and AGP Architecture Specification Rev. 1.0, andincorporated herein by reference.

Multimedia processor 100 can function as either a master or a slavedevice when coupled to either PCI or AGP (Accelerated Graphics Port) busvia interface unit 130. Because the two buses can be coupled tomultimedia processor 100 independent from each other, multimediaprocessor 100 can operate as the bus master device on one channel and aslave device on the other. To this end multimedia processor 100 appearsas a multifunction PCI/AGP device, when it operates as a slave devicefrom the point of view of a host system.

Data streamer 122 is also coupled to an input/output I/O bus 132 via adirect memory access, DMA, controller 138. A plurality of I/O devicecontrollers 134 are coupled also to I/O bus 132. In accordance with oneembodiment of the present invention, the output ports of I/O devicecontrollers 134 are coupled to input ports of a versa port multiplexer136.

A programmable input/output controller (PIOC) 126 is coupled to datatransfer switch 112 at some of its ports and to I/O bus 132 at other ofits ports.

In accordance with one embodiment of the invention, I/O devicecontrollers 134 together define an interface unit 202 that is configuredto provide an interface between multimedia processor 100 and the outsideworld. As will be explained in more detail in reference with FIG. 1(b),multimedia processor 100 can be configured in a variety ofconfigurations depending on the number of I/O devices that are activatedat any one time.

As illustrated in FIG. 1(a), data transfer switch 112 includes aprocessor memory bus (PMB) 114, which is configured to receive addressand data information from fixed function unit 106, data cache 108 andinstruction cache 110 and data streamer 122.

Data transfer switch 112 also includes an internal memory bus (IMB) 120,which is configured to receive address and data information from memorycontroller 124, data streamer 122, programmable input/output (I/O)controller 126, and a PCI/AGP controller 130.

Data transfer switch 112 also includes a request bus 118, which isconfigured to receive request signals from all components of multimediaprocessor 100 coupled to the data transfer switch.

Data transfer switch 112 also includes a switchable transceiver 116,which is configured to provide data connections between processor memorybus (PMB) 114 and internal memory bus (IMB) 120. Furthermore, datatransfer switch 112 includes three bus arbiter units 140, 142 and 144respectively. Thus, a separate bus arbitration for request and databuses is handled, based on system needs as explained in detail below.Furthermore, as illustrated in FIG. 1(a), whereas different componentsin multimedia processor 100 are coupled to either processor memory bus114 or internal memory bus 120 as separate groups, data streamer 122 iscoupled to both memory buses directly. In accordance with one embodimentof the present invention, both processor memory bus 114 and internalmemory bus 120 are 64 bits or 8 bytes wide, operating at 200 MHZ for apeak bandwidth of 1600 MB's each.

In accordance with one embodiment of the invention, each bus arbiter,such as 140, 142 and 144, includes a four level first-in-first-out(FIFO) buffer in order to accomplish scheduling of multiple requeststhat are sent simultaneously. Typically, each request is served based onan assigned priority level.

All of the components that are coupled to data transfer switch 112 arereferred to as a data transfer switch agent. Furthermore, a componentthat requests to accomplish an operation is referred to in the presentcontext as an initiator or bus master. Similarly, a component thatresponds to the request is referred to in the present context as aresponder or a bus slave. It is noted that an initiator for a specificfunction or at a specific time may be a slave for another function or atanother time. Furthermore, as will be explained in more detail, all datawithin multimedia processor 100 is transmitted using one or both of databuses 114 and 120 respectively.

The protocol governing the operation of internal memory bus (1 MB) andprocessor memory bus (PMB) is now explained in more detail. Inaccordance with one embodiment of the present invention, request buses114, 118 and 120 respectively, include signal lines to accommodate arequest address, which signifies the destination address. During arequest phase the component making a request is the bus master, and thecomponent located at the destination address is the bus slave. Therequest buses, also include a request byte read enable signal, and arequest initiator identification signal, which identifies the initiatorof the request.

During a data transfer phase, the destination address of the requestphase becomes the bus master, and the initiating component during therequest phase becomes the bus slave. The buses also include lines toaccommodate for a transaction identification ID signal, which areuniquely generated by a bus slave during a data transfer phase.

Additional lines on the buses provide for a data transfer size, so thatthe originator and the destination end points can keep a track on thesize of the transfer between the two units. Furthermore, the busesinclude signal lines to accommodate for the type of the command beingprocessed.

The operation of interface unit 202 in conjunction with multiplexer 136is described in more detail hereinafter in reference with FIG. 1(b).

Interface Unit & Multiplexer

Multimedia processor 100 enables concurrent multimedia and I/O functionsas a stand alone unit or on a personal computer with minimal hostloading and high media quality. Multiplexer 136 provides an I/O pinsetwhich is software configurable when multimedia processor 100 is booted.This makes the I/O functions flexible and software upgradable. The I/Opinset definitions depend on the type of I/O device controller 134 beingactivated.

Thus, in accordance with one embodiment of the invention, the I/Ointerface units configured on multimedia processor 100 can be changed,for example, by loading a software upgrade and rebooting the chip.Likewise as new standards and features become available, softwareupgrades can take the place of hardware upgrades.

I/O interface unit includes an NTSC/PAL encoder and decoder devicecontroller 224, which is coupled to I/O bus 132 and multiplexer 136.ISDN GCI controller unit 220 is also coupled to I/O bus 132 andmultiplexer 136. Similarly a T1 unit 210 is coupled to I/O bus 132 andmultiplexer 136. A Legacy audio signal interface unit 218 is coupled toI/O bus 132 and multiplexer 136, and, is configured to provide audiosignal interface in accordance with an audio protocol referred to asLegacy. Audio codec unit 214 is configured to provide audio-codecinterface signals. Audio codec unit 214 is coupled to I/O bus 132 andmultiplexer 136. A universal serial bus (USB) unit 222 is coupled to I/Obus 132 and multiplexer 136. USB unit 222 allows multimedia processor100 communicate with a USB bus for receiving control signals from, forexample, keyboard devices, joy sticks and mouse devices. Similarly, anIEC958 interface 208 is coupled to I/O bus 132 and multiplexer 136.

An I²S (Inter-IC Sound) interface 212 is configured to drive adigital-to-analog converter (not shown) for home theater applications.I²S interface is commonly employed by CD players where it is unnecessaryto combine the data and clock signals into a serial data stream. Thisinterface includes separate master clock, word clock, bit clock, dataand optional emphasis flag.

An I²C bus interface unit 216 is configured to provide communicationsbetween multimedia processor 100 and external on-board devices. Theoperation of IIC standard is well known and described in PhillipsSemiconductors The I ² C-bus and How to Use it (includingspecifications) (April 1995), and incorporated herein by reference.

Bus interface unit 216 operates in accordance with a communicationsprotocol known as display data channel interface (DDC) standard. The DDCstandard defines a communication channel between a computer display anda host system. The channel may be used to carry configurationinformation, to allow optimum use of the display and also, to carrydisplay control information. In addition, it may be used as a datachannel for Access bus peripherals connected to the host via thedisplay. Display data channel standard calls for hardware arrangementswhich are configured to provide data in accordance with VESA (VideoElectronics Standard Association) standards for display data channelspecifications.

The function of each of the I/O device controllers mentioned above isdescribed in additional detail hereinafter.

RAMDAC or SVGA DAC interface 204 provides direct connection to anexternal RAMDAC. The interface also includes a CRT controller, and aclock synthesizer. The RAMDAC is programmed through I²C serial bus.

NTSC decoder/encoder controller device 224 interfaces directly to NTSCvideo signals complying with CCIR601/656 standard so as to provide anintegrated and stand-alone arrangement. This enables multimediaprocessor 100 to directly generate high-quality NTSC or PAL videosignals. This interface can support resolutions specified by CCIR601standard. Advanced video filtering on processor 102 producesflicker-free output when converting progressive-to-interlaced andinterlaced-to-progressive output. The NTSC encoder is controlled throughthe I²C serial bus.

Similarly, the NTSC decoder controller provides direct connection to aCCIR601/656 formatted NTSC video signal which can generate up to a16-bit YUV at a 13.5 MHZ Pixel rate. The decoder is controlled throughthe I²C serial bus.

ISDN (Integrated Services Digital Networks standard) interface 220includes a 5-pin interface which supports ISDN BRI (basic rateinterface) via an external ISDN U or S/T interface device. ISDN standarddefines a general digital telephone network specification and has beenin existence since the mid 1980's. The functionality of this module isbased on the same principle as a serial communication controller, usingIDL2 and SCP interfaces to connect to the ISDN U-Interface devices.

T1 interface 210 provides a direct connection to any third party T1 CSU(channel service unit) or data service unit (DSU) through a T1 serial orparallel interface. The CSU/DSU and serial/parallel output are softwareconfigurable through dedicated registers. Separate units handle signaland data control. Typically the channel service unit (CSU) regeneratesthe waveforms received from the T1 network and presents the user with aclean signal at the DSC-1 interface. It also regenerates the data sent.The remote test functions include loopback for testing from a networkside. Furthermore, a data service unit (DSU) prepares the customer'sdata to meet the format requirements of the DSC-1 interface, for exampleby suppressing zeros with special coding. The DSU also provides theterminal with local and remote loopbacks for testing.

A single multimedia processor, in accordance with one embodiment of theinvention is configured to handle up to 24 channels of V.34 modem datatraffic, and can mix V.PCNL and V.34 functions. This feature allowsmultimedia processor 100 to be used to build modem concentrators.

Legacy audio unit 218 is configured to comply with Legacy audio Pro8-bit stereo standard. It provides register communications operations(reset, command/status, read data/status), digitized voice operations(DMA and Direct mode), and professional mixer support (CT1 345, ModuleMixer). The functions of this unit include:

8-bit monaural/stereo DMA slave mode play/record;

8-bit host I/O interface for Direct mode play/record;

Reset, command/data, command status, read data and read status registersupport;

Professional mixer support;

FM synthesizer (OPLII, III, or IV address decoding);

MPU401 General MIDI support;

Joystick interface support;

Software configuration support for native DOS mode; and

PnP (plug and play) support for resources in Windows DOS box.

A PCI signal decoder unit provides for direct output of PCI legacy audiosignals through multiplexer 136 ports.

AC Link interface 214 is a 5 pin digital serial interface which isbidirectional, fixed rate, serial PCM digital stream. It can handlemultiple input and output audio streams, as well as control registeraccesses employing a TDM format. The interface divides each audio frameinto 12 outgoing and 12 incoming data streams, each with 20-bit sampleresolution. Interface 214 includes a codec that performs fixed 48 KS/SDAC and ADC mixing, and analog processing.

Transport channel interface (TCI) 206 accepts demodulated channel datain transport layer format. It synchronizes packet data from satellite orcable, then unpacks and places byte-aligned data in the multimediaprocessor 100 memory through the DMA controller. Basically, thetransport channel interface accepts demodulated channel data intransport layer format. A transport layer format consists of 188 bytepackets with a four byte header and a 184 byte payload. The interfacecan detect the sync byte which is the first byte of every transportheader. Once byte sync has been detected, the interface passes bytealigned data into memory buffers of multimedia processor 100 via datastreamer 122 and data transfer switch 112 (FIG. 1(a)). The transportchannel interface also accepts MPEG-2 system transport packets in byteparallel or bit serial format.

Multimedia processor 100 provides clock correction and synchronizationfor video and audio channels.

Universal Serial Bus (USB) interface 222 is a standard interface forcommunication with low-speed devices. This interface conforms to thestandard specification. It is a four-pin interface (two power and twodata pins) that expects to connect to an external module such as thePhilips PDIUSBII.

Multimedia processor 100 does not act as a USB hub, but can communicatewith both 12 Mbps and 1.5 Mbps devices. It is software configurable torun at either speed. When configured to run at the 12 Mpbs speed, it cansend individual data packets to 1.5 Mbps devices. In accordance with oneembodiment of the invention multimedia processor 100 communicates withup to 256 devices through the USB.

The USB is a time-slotted bus. Time slots are one millisecond. Each timeslot can contain multiple transactions that can be isochronous,asynchronous, control, or data. Furthermore, data transactions can beindividual packets or can be bulk transactions. Data transactions areasynchronous. Data is NRZI with bit stuffing. This guarantees atransition for clock adjustment at least once every six bits variablelength data packets are CRC protected. Bulk data transactions breaklonger data streams up into packets of up to 1023 bytes per packet, andsend one packet per time-slot.

IEC958 interface unit 208 is configured to support several audiostandards, such as Sony Philips Digital Interface (SPDIF); AudioEngineering Society/European Broadcast Union (ES/EBU) interface; TOSLINKinterface; The TOSLINK interface requires external IR devices. TheIEC958 protocol convention calls for each multi-bit field in a soundsample to be shifted in or out with the least significant bit first(little-endian).

Interface unit 202 also includes an I²S controller unit 212 which isconfigured to drive high-quality (better than 95 dB SNR) audiodigital-to-analog (D/A) converters for home theater. Timing is softwareconfigurable to either 18 or 16 bit mode.

I²C unit 216 employs the I²C standard primarily to facilitatecommunications between multimedia processor 100 and external onboarddevices. Comprising a two-line serial interface, I²C unit 216 providesthe physical layer (signaling) that allows the multimedia processor 100serve as a master and slave device residing on the I²C bus. As a resultthe multimedia processor 100 does not require additional hardware torelay status and control information to external devices.

DDC interface provides full compliance with the VESA standards forDisplay Data Channel (DDC).specifications versions 1, and 2a. DDCspecification compliance is offered for: DDC control via two pins in thestandard VGA connector; DDC control via I²C connection through two pinsin the standard VGA connector.

It is noted that each of the I/O units described above advantageouslyinclude a control register (not shown) which corresponds to a PIOregister located at a predetermined address on I/O bus 132. As a result,each of the units may be directly controlled by receiving appropriatecontrol signals via I/O bus 132.

Thus, in accordance with one embodiment of the invention, multimediaprocessor 100 may be employed in a variety of systems by reprogrammingthe I/O configurations of the I/O unit 202 such that a desired set ofI/O devices have access to outside world via multiplexer 136. The pinconfigurations for multiplexer 136 varies based on the configuration ofthe I/O unit 202. Some of the exemplary applications that a systememploying multimedia processor 100 may be used include a threedimensional 3D geometry PC, a multimedia PC, a set-top box/3Dtelevision, or Web TV, and a telecommunications modem system.

During operation, processor 102 may be programmed accordingly to providethe proper signaling via I/O bus 132 to I/O unit 202 so as to couple thedesired I/O units to outside world via multiplexer 136. For example, inaccordance with one embodiment of the invention, TCI unit 206 may beactivated to couple to an external tuner system (not shown) viamultiplexer 136 to receive TV signals. Multimedia processor 100 maymanipulate the received signal and display it on a display unit such asa monitor. In another embodiment of the invention, NTSC unit 224 may beactivated to couple to an external tuner system (not shown) viamultiplexer 136 to receive NTSC compliant TV signals.

It will be appreciated that other applications may also be employed inaccordance with the principles of the present invention. For purposes ofillustrations, FIGS. 1© and 1(d) show block diagrams of two typicalsystems arranged in accordance with two embodiments of the presentinvention, as discussed hereinafter.

Thus, a multimedia system employing multimedia processor 100 isillustrated in FIG. 1(c), which operates with a host processor 230, suchas an X86®, in accordance with one embodiment of the present invention.Multimedia processor 100 is coupled to a host processor 230 via anaccelerated graphics bus AGP. Processor 230 is coupled to an ISA bus viaa PCI bus 260 and a south bridge unit 232. An audio I/O controller suchas 218 (FIG. 1(b)) is configured to receive from and send signals to ISAbus 258 via ISA SB/Comm mapper 232 and multiplexer 136. Furthermore,I²C/DDC driver unit 216 is configured to receive corresponding standardcompliant signals via multiplexer 136. Driver unit 216 receives displaydata channel signals which are intended to provide signals forcontrolling CRT resolutions, screen sizes and aspect ratios. ISDN/GCIdriver unit 221 of multimedia processor 100 is configured to receivefrom and send signals to an ISDN U or S/T interface unit 236

Multimedia processor 100 provides analog RGB signals via display refreshunit 226 to a CRT monitor (not shown). Multimedia processor 100 is alsoconfigured to provide NTSC or PAL compliant video signals via CCIR/NTSCdriver unit 224 and NTSC encoder unit 238. Conversely, multimediaprocessor 100 is also configured to receive NTSC or PAL compliant videosignals via CCIR/NTSC driver unit 224 and NTSC decoder unit 240. A localoscillator unit 244 is configured to provide a 54 MHz signal tomultimedia processor 100 for processing the NTSC signals.

A demodulator unit 246 is coupled to transport channel interface driverunit 206 of multimedia processor 100. Demodulator unit 246 is configuredto demodulate signals based on quadrature amplitude modulation, orquadrature phase shift keying modulation or F.E.C.

A secondary PCI bus 252 is also coupled to multimedia processor 100 andis configured to receive signals generated by a video decoder 248 so asto provide NTSC/PAL signals in accordance with Bt484 standard, providedby Brooktree®. Furthermore, bus 252 receives signals in accordance with1394 link/phy standard allowing high speed serial data interface via1394 unit 250. Bus 252 may be also coupled to another multimediaprocessor 100.

Finally, multimedia processor 100 is configured to receive analog audiosignals via codec 254 in accordance with AC'97 standard. A localoscillator 256 generates an oscillating signal for the operation ofAC'97 codec.

FIG. 1(d) illustrates a stand alone system, such as a multimedia TV orWEB TV that employs multimedia processor 100 in accordance with anotherembodiment of the invention. In a stand-alone configuration, multimediaprocessor 100 activates universal serial bus (USB) driver unit 222allowing control via user-interface devices such as keyboards, mouse andjoysticks. It is noted that for the stand-alone configuration, VLIWprocessor performs all the graphic tasks in conjunction with othermodules of multimedia processor 100 as will be explained later. However,for the arrangement that operates with a host processor 230, some of thegraphic tasks are performed by the host processor.

Data Transfer Switch

FIG. 2 is a flow diagram of the operation of data transfer switch inaccordance with one embodiment of the present invention, although theinvention is not limited in scope in that respect.

FIG. 2 illustrates the flow diagram of a bus protocol, which describesan example of the initiation phase in a write transaction from onefunctional unit in multimedia processor 100 to another unit inmultimedia processor 100, such as a transaction to write data in datacache 108 to a location in SDRAM 128 via memory controller 124, althoughthe invention is not limited in scope in that respect. Thus, for thisexample, the request bus master is data cache 108, and the request busslave is memory controller 124. At step 402, request bus master sends awrite request, along with a responder ID and a specifiable prioritylevel to request bus arbiter 140. At step 404, request bus arbiterdetermines whether the request bus slave, in this case, memorycontroller 124, is ready to accept a write request. If so, request busarbiter 140 sends a grant signal to data cache 108, along with atransaction ID, and in turn sends a write request to memory controller124.

At step 406, request bus master provides address, command, size and itsown identifier ID signals on request bus 118. Meanwhile, request busslave in response to the previous request signal, sends an updated readysignal to request bus arbiter 140 so as to indicate whether it canaccept additional requests. Furthermore, the request bus slave puts thetransaction identifier ID on the request bus. This transactionidentifier is used to indicate that an entry for this transaction existsin the slave's write queue. The request bus master samples thistransaction ID when it receives data corresponding to this request fromthe bus slave.

For the write transaction explained above, request bus master, forexample, data cache 108 also becomes a data bus master. Thus, at step408, data cache 108 sends a write request, along with a receiveridentifier, the applicable priority level and the transaction size todata bus arbiter, in this case processor memory bus 114. At step 410,data bus arbiter 114 sends a grant signal to data bus master, and inturn sends a request signal to data bus slave (memory controller 124 forthe present example).

At step 412, data bus master provides data and byte enables up to fourconsecutive cycles, on the data bus. In response, data bus slave samplesthe data. The data bus master also provides the transaction ID that itoriginally received from the request bus slave at step 404. Finally, thedata bus arbiter provides the size of the transaction for use by thedata bus slave.

FIG. 3 a illustrates a flow diagram of a read transaction that employsdata transfer switch 112. For this example, it is assumed that datacache 108 performs a read operation on SDRAM 128. Thus, at step 420request bus master (data cache 108 for the present example) sends a readrequest, along with a responder identifier ID signal, and a specifiablepriority level to request bus arbiter 140. At step 422, request busarbiter determines whether request bus slave is available for thetransaction. If so, request bus arbiter 140 sends a grant signal torequest bus master, along with a transaction ID, and also sends a readrequest to the request bus slave (memory controller 124 in the presentexample). At step 424, the request bus master (data cache 108) providesaddress, size, byte read enable, and its own identification signal ID,on the request bus. Meanwhile, request bus slave updates its readysignal in request bus arbiter 140 to signify whether it is ready toaccept more accesses. Request bus master also provides the transactionID signal on the request bus. This transaction ID, is employed toindicate that a corresponding request is stored in the bus master's readqueue.

FIG. 3 b illustrates the response phase in the read transaction. At step426, request bus slave (memory controller 124) becomes the data busmaster When the data bus master is ready with the read data, it sends arequest, a specfiable priority level signal, and the transaction size tothe appropriate data bus arbiter; for this example, internal memory busarbiter 142. At step 428, internal memory bus arbiter 142 sends a grantsignal to the data bus master, and sends a request to the data busslave—data cache 108. At step 430, data bus master (memory controller124) provides up to four consecutive cycles of data to internal data bus120. The data bus master also provides a transaction identificationsignal, transaction ID, which it received during the request phase.Finally, internal bus arbiter controls the transaction size for theinternal bus slave (data cache 108) to sample.

In sum, in accordance with one example of the invention, the initiatorcomponents request transfers via the request bus arbiter. Each initiatorcan request 4, 8, 16, 24 and 32 byte transfer. The transaction, however,must be aligned on the communication size boundary. Each initiator maymake a request in every cycle. Furthermore, each write initiator mustsample the transaction ID from the responder during the send phase andmust then send it out during the response phase.

Furthermore, during the read operations, the responders are configuredto determine when to send the requested data. The read responders samplethe initiator ID signal during the send phase so that they know whichdevice to send data to during the response phase. The read responderssample the transaction ID signal from the initiator during the sendphase and then send it out during the response phase. During the writeoperations, the responders are configured to accept write data afteraccepting a write request.

Table 1 illustrates an exemplary signal definition, for request bus 118,in accordance with one embodiment of the invention. Table 2 illustratesan exemplary signal definition, for data buses 114 and 120 in accordancewith one embodiment of the invention.

Request Bus TABLE 1 Rqb_addr [31:2] Physical address Rqb_bre [3:0] ByteRead Enable (undefined during writes)- Since the request bus address hasa 4-byte granularity, the byte read enable signifies which of the fourbytes are being read. Rqb_bre[0] is set for byte 0, Rqb_bre[1] is setfor byte 1, and so on. All bits are set when reading 4 or more bytes.The read initiator is configured to generate any combinations of byteread enables. Rqb_init_id [3:0] Request Initiator ID signal, which isthe identification signal of the device making the request. Rqb_tr_id[7:0] Request Transaction ID - This is determined by the device whichreceives data. Since this device can be the initiator in a readtransaction or the responder in a write transaction, it can set thetransaction ID so that it can distinguish between these cases when dataarrives. Also, since read and write requests can be completedout-of-order, the transaction ID can be used to signify the request thatcorresponds to the incoming data. Rqb_sz [2:0] Request size- This can bepredetermined request size lengths, such as 4 bytes; 8 bytes; 16 bytes;24 bytes; and 32 bytes. Since the smallest size is four bytes, a writerinitiator signifies which bytes to be written using the data Burst ByteEnables as discussed in Table 2 below. A read initiator signifies whichbytes are being read using Rqb_bre [3:0] described above. Rqb_cmd [2:0]Request Command- This signifies the type of operation being performed.000 Memory Operation 001 Programmable Input/Output, PIO, operation 010Memory allocate operation

Data Bus TABLE 2 Imb_data [63:0] Internal Memory Data Bus- The databuses are little-endian: byte 0 is data[7:0], byte 1 is data[15:8], . .. , and byte 7 is data[63:56]. Data is preferably placed in the correctbyte positions - it is preferably not aligned to the LSB. Imb_be[7:0]IMB Byte Write Enables (undefined during reads)- This is used by a writeinitiator to signify which bytes are to be written. Imb_be[0] is setwhen writing byte 0, Imb_be[1] is set when writing byte 1, and so on.When writing 8 or more bytes, all bits should be set. The writeinitiator is allowed to generate any combination of byte enables.Imb_tr_id[5:0] IMB Transaction ID - This is identical to the transactionID sent on the Request Bus. Pmb_data[63:0] Processor Memory Data BusPmb_be[7:0] PMB Byte Write Enables (undefined during reads)Pmb_tr_id[7:0] PMB Response Transaction ID

Tables 3 through 9 illustrate command calls employed when transferringdata via data transfer switch 112. TABLE 3 RQB Master to RQB ArbiterXx_rqb_rd_req1 Read Request 1 Xx_rqb_wr_req1 Write Request 1Xx_rqb_resp_id1[3:0] Responder ID 1 - the device ID of the responder. Ithas the same encoding as the initiator ID. Xx_rqb_pri1[1:0] Priority 100 Highest 01 10 11 Lowest Xx_rqb_rd_req2 Read Request 2 - in case thereis a back-to-back request Xx_rqb_wr_req2 Write Request 2Xx_rqb_resp_id2[3:0] Responder ID 2 Xx_rqb_pri2[1:0] Priority 2

TABLE 4 RQB Slave to RQB Arbiter Xx_rqb_rd_rdy1 Read Ready (1 or more)Xx_rqb_wr_rdy1 Write Ready (1 or more) Xx_rqb_rd_rdy2 Read Ready (2 ormore) - see back-to-back requests below Xx_rqb_wr_rdy2 Write Ready (2 ormore)

TABLE 5 RQB Arbiter to RQB Arbiter Dts_rqb_gnt_xx Bus Grant

TABLE 6 RQB Arbiter to RQB Slave Dts_rqb_rd_req_xx Read RequestDts_rqb_wr_req_xx Write Request

TABLE 7 Data Bus Master to Data Bus Arbiter Xx_imb_req1 IMB request 1Xx_imb_init_id1 IMB receiver ID 1 Xx_imb_sz1 IMB size 1 Xx_imb_pri1 IMBpriority 1 Xx_imb_req2 IMB request 2 Xx_imb_init_id2 IMB receiver ID 2Xx_imb_sz2 IMB size 2 Xx_imb_pri2 IMB priority 2 Xx_pmb_req1 PMB request1 Xx_pmb_init_id1 PMB slave ID 1- the ID of the device receiving data.It has the same encoding as Rqb_init_id. Xx_pmb_sz1 PMB size 1- Thistells the arbiter how many cycles are needed for the transaction. It hasthe same encoding as Rqb_sz. Xx_pmb_pri1 PMB priority 1 Xx_pmb_req2 PMBrequest 2- see back-to-back requests below Xx_pmb_init_id2 PMB receiverID 2 Xx_pmb_sz2 PMB size 2 Xx_pmb_pri2 PMB priority 2

TABLE 8 Data Bus Arbiter to Data Bus Master Dts_imb_gnt_xx IMB grantDts_pmb_gnt_xx PMB grant

TABLE 9 Data Bus Arbiter to Data Bus Slave Dts_imb_req_xx IMB requestDts_pmb_req_xx PMB request

FIGS. 4(a) and 4(b) illustrate the flow of signals during a request busconnection and an internal memory bus connection, respectively, inaccordance with one embodiment of the invention. For example, in FIG.4(a), a request bus initiator sends request information to request busarbiter 140 in accordance with Table 3. Such request information mayinclude a request bus read/write request. The request bus responderidentification signal, ID, and the priority level of the request. Therequest bus arbiter sends read/write request signals to the identifiedresponder or request bus slave (Table 6), in response to which, theresponder sends back ready indication signals to request bus arbiter(Table 4). Upon receipt of the ready indication signal, request busarbiter sends a request bus grant signal to the initiator (Table 5).Once the grant signal is recognized by the initiator, transactioninformation in accordance with table—1—is transmitted to the respondervia the request bus. To this end a Request bus transaction ID isassigned for the particular transaction to be processed.

FIG. 4(b) illustrates a data bus connection using internal memory bus120. Thus, once the transaction information and identification has beenset up during the request bus arbitration phase, the initiator andresponder begin to transfer the actual data. The initiator transmits tointernal memory bus arbiter 142 the transaction information includingthe request, size, initiator identification signal, ID, and the prioritylevel in accordance with signals defined in Table 7. Internal memory busarbiter 142 send a request information to the responder, in addition tothe size information in accordance with Table 8. Thereafter the arbitersends a grant signal to the initiator, in response to which, the actualdata transfer occurs between the initiator and the responder inaccordance with Table 2.

FIG. 5(a) illustrates the timing diagram for a request bus readoperation. FIG. 5(b) illustrates the timing diagram for a read requestwhere the grant is not given immediately. FIG. 5(c) illustrates thetiming diagram for a request bus write operation. It is noted that forthe write operation, the request bus transaction identification signal,ID, is provided by the responder. Finally, FIG. 5(d) illustrates thetiming diagram for a data bus data transfer operation. It is noted thatfor a read transaction, the data bus master is the read responder andthe data bus slave is the read initiator.

Data transfer switch 112 is configured to accommodate back-to-backrequests made by the initiators. As illustrated in the timing diagrams,the latency between sending a request and receiving a grant is twocycles. In the A0 (or D0) cycle, arbiter 140 detects a request from abus master. However, in the A1 (or D1) cycle, the bus master preferablykeeps its request signal—as well as other dedicated signals to thearbiter-asserted until it receives a grant. As such, arbiter 140 cannottell from these signals whether the master wants to make a secondrequest.

In order to accommodate a back-to-back request, a second set ofdedicated signals from the bus master to arbiter 140 is provided so thatthe master can signal to the arbiter that there is a second requestpending. If a master wants to perform another request while it iswaiting for its first request to be granted, it asserts its second setof signals. If arbiter 140 is granting the bus to a master in thecurrent cycle, it must look at the second set of signals from thatmaster when performing the arbitration for the following cycle. When amaster receives a grant for its first request, it transfers all theinformation in the lines carrying the second set of request signals tothe lines carrying first set of request signals. This is required incase the arbiter cannot grant the second request immediately.

The ready signals from a RQB slave are also duplicated for a similarreason. When RQB arbiter 140 sends a request to a slave, the earliest itcan see an updated ready signal is two cycles later. In the A0 cycle, itcan decide to send a request to a slave based on its ready signals.However, in the A1 cycle, the slave has not updated its ready signalsbecause it has not seen the request yet. Therefore, arbiter 140 cannottell from this ready signal whether or not the slave can accept anotherrequest.

A second set of ready signals from the RQB slave to RQB arbiter 140 isprovided so that the arbiter can tell whether the slave can accept asecond request. In general, the first set of ready signals signifywhether at least one request can be accepted and the second set of readysignals signify whether at least two requests can be accepted. Ifarbiter 140 is sending a request to a slave in the current cycle, itmust look at the second set of ready signals from that slave whenperforming the arbitration for the next cycle.

It is noted that there are ready signals for reads and writes. RQBslaves may have different queue structures (single queue, separate readqueue and write queue, etc.). RQB arbiter 140 knows the queueconfiguration of the slave to determine whether to look at the first orsecond read ready signal after a write, and whether to look at the firstor second write ready signal after a read.

FIG. 6(a) illustrates a timing diagram for a request bus master making aback-to-back read request. FIG. 6(b) illustrates a timing diagram for aprocessor memory bus master making a back-to-back request, when thegrant is not immediately granted for the second request. Finally, FIG.6(c) illustrates a timing diagram for a request bus slave receiving aread request followed by a write request, assuming that the request busslave has a unified read and write queue.

Data Streamer

The operation of data streamer 122 is now discussed in additionaldetail. The data streamer is employed for predetermined buffered datamovements within multimedia processor 100. These data movements inaccordance with specifiable system configuration may occur betweenmemory or input/output (I/O) devices that have varying bandwidthrequirements. Thus, any physical memory in connection with multimediaprocessor 100 can transmit and receive data by employing data streamer122. These memory units include external SDRAM memory 128, data cache108, fixed function unit 106, input/output devices connected to inputoutput (I/O) bus 132, and any host memory accessed by either the primaryor secondary PCI bus controller 130. In accordance with one embodimentof the invention, data streamer 122 undertakes data transfer actionsunder a software control, although the invention is not limited in scopein that respect. To this end a command may initiate a data transferoperation between two components within the address space defined formultimedia processor 100.

FIG. 7 illustrates a block diagram of data streamer 222 in accordancewith one embodiment of the invention, although the invention is notlimited in scope in this respect. Data streamer 122 is coupled to datatransfer switch 112 via a data transfer switch interface 718. A transferengine 702 within data streamer 122 is employed for controlling the datatransfer operation of data streamer 122. As will be explained in moredetail below, transfer engine 702 implements a pipeline control logic tohandle simultaneous data transfers between different components ofmultimedia processor 100.

The transfer engine is responsible to execute user programs, referred toherein as descriptors that describe a data transfer operation. Adescriptor as will be explained in more detail below, is a data fieldthat includes information relating to a memory transfer operation, suchas data addresses, pitch, width, count and control information.

Each descriptor is executed by a portion of data streamer 122 hardwarecalled a channel. A channel is defined by some bits of state in apredetermined memory location called channel state memory 704. Channelstate memory 704 supports 64 channels in accordance with one embodimentof the invention. As illustrated in FIG. 7, channel state memory 704 iscoupled to transfer engine 702. At any given time a number of these 64channels are active and demand service. Each active channel works with adescriptor. Data streamer 122 allocates one or two channels for a datatransfer operation. These channels remain allocated to the same datatransfer operation until data is transferred from its originationaddress to its destination address within multimedia processor 100. Aswill be explained in more detail, data streamer 122 allocates onechannel for input/output to memory transfers, and allocates two channelsfor memory to memory transfers.

Transfer engine 702 is coupled to data transfer switch interface 718 forproviding data transfer switch request signals that are intended to besent to data transfer switch 112. Data transfer switch interface 718 isconfigured to handle outgoing read requests for data and descriptorsthat are generated by transfer engine 702. It also handles incoming datafrom data transfer switch 112 to appropriate registers in internalfirst-in-first-out buffer 716. Data transfer switch interface 718 alsohandles outgoing data provided by data streamer 122.

Data streamer 122 also includes a buffer memory 714 which in accordancewith one embodiment of the invention is a 4 KB SRAM memory, physicallyimplemented within multimedia processor 100, although the invention isnot limited in scope in that respect. Buffer memory 714 includes dualported double memory banks 714 (a) and 714 (b) in accordance with oneembodiment of the invention. It is noted that for a data streamer thathandles 64 channels, buffer memory 714 may be divided into 64 smallerbuffer spaces.

The data array in buffer memory 714 is physically organized as 8 bytesper line and is accessed 8 bytes at a time, by employing a maskingtechnique. However, during the operation, a 4 kB of memory is dividedinto smaller buffers, each of which is used in conjunction with a datatransfer operation. Therefore, a data transfer operation employs a datapath within data streamer 122 that is defined by one or two channels andone buffer. For memory-to-memory transfer two channels are employed,whereas, for I/O-to-memory transfer one channel is employed. It is notedthat the size of each smaller buffer is variable as specified by thedata transfer characteristics.

In accordance with one embodiment of the invention, the data moveoperations are carried out based on predetermined chunk sizes. A sourcechunk size of “k” implies that the source channel should triggerrequests for data when the destination channel has moved “k” bytes outof buffer memory 714. Similarly, a destination chunk size of “k” impliesthat the destination channel should start moving data out of buffer 714when the source channel has transferred “k” bytes of data into thebuffer. Chunk sizes are multiple of 32 bytes, although the invention isnot limited in scope in that respect.

Buffer memory 714 is accompanied by a valid-bit memory that holds 8 bitsper line of 8 bytes. The value of the valid bit is used to indicatewhether the specific byte is valid or not. The sense of the valid bit isflipped each time the corresponding allocated buffer is filled. Thisremoves the necessity to re-initialize the buffer memory each time achunk is transferred. However, the corresponding bits in the valid-bitsarray are initialized to zeroes whenever a buffer is allocated for adata transfer path.

Buffer memory 714 is coupled to and controlled by a data streamer buffercontroller 706. Buffer controller 706, is also coupled to transferengine 702, and DMA controller 138, and is configured to handle read andwrite requests received from the transfer engine and the DMA controller.Buffer controller 706 employs the data stored in buffer state memory 708to accomplish its tasks. Buffer controller 706 keeps a count of thenumber of bytes that are brought into the buffer and the number of bytesbeing taken out. Data streamer buffer controller 706 also implements apipelined logic to handle the 64 buffers and manage the read and writeof data into buffer memory 714.

Buffer state memory 708 is used to keep state information about each ofthe buffers used in a data path. As mentioned before, the buffer statememory supports 64 individual buffer FIFOs.

DMA controller 138 is coupled to I/O bus 132. In accordance with oneembodiment of the invention, DMA controller 138 acts to arbitrate amongthe I/O devices that want to make a DMA request. It also providesbuffering for DMA requests coming into the data streamer buffercontroller and data going back out to the I/O devices. The arbitrationrelating to DMA controller 138 is handled by a round-robin priorityarbiter 710, which is coupled to DMA controller 138 and I/O bus 132.Arbiter 710 arbitrates the use of the I/O data bus between physicalinput/output controller, PIOC 126 and DMA controller 138.

In accordance with one embodiment of the invention, data streamer 122treats data cache 108 as an accessible memory component and as suchallows direct read and write access to data cache 108. As will beexplained in more detail data streamer 122 is configured to maintaincoherency in the data cache, whenever a channel descriptor specifies adata cache operation. The ability to initiate read and write requests todata cache by other components of multimedia processor 100 is suitablefor data applications wherein the data to be used by CPU 102 and 104respectively is known beforehand. Thus, the cache hit ratio improvessignificantly, because the application can fill necessary data beforeCPU 102 or 104 uses the data.

As stated before, data streamer 122 in accordance with one embodiment ofthe invention operates based on a user specified software program, byemploying several application programing interface, or API, librarycalls. To this end, programmable input/output controller PIOC 126 actsas an interface between other components of multimedia processor 100 anddata streamer 122. Therefore, the commands used to communicate with datastreamer 122, at the lowest level translate to PIO reads and writes inthe data streamer space. Thus, any component that is capable ofgenerating such PIO read and write operations can communicate with datastreamer 122. In accordance with one embodiment of the invention, theseblocks include fixed function unit 106, central processing units 102,104, and a host central processing unit coupled to multimedia processor100 via , for example, a PCI bus.

In accordance with one embodiment of the invention, data streamer 122occupies 512 K bytes of PIO (physical memory) address space. Each datastreamer channel state memory occupies less than 64 bytes in a 4 K bytepage. Each data streamer channel state memory is in a separate 4K bytepage for protection, however, the invention is not limited in scope inthat respect.

Table 10, illustrates the address ranges used for various devices. Forexample, the bit in position 18 is used to select between transferengine 702 and other internal components of data streamer 122. The othercomponents include the data RAM used for buffer memory, the valid RAMbits that accompany the data RAM, the data streamer buffer controllerand the DMA controller. TABLE 10 PIO Address Map of the DATA STREAMERStarting PIO Ending PIO OFFSET OFFSET USAGE 0x00000 0x3FFFF Transferengine channel state memory and other user commands. 0x40000 0x40FFF DSBuffer Data Ram. 0x41000 0x41FFF DS Buffer Valid Ram 0x42000 0x42FFF DSBuffer Controller 0x43000 0x43FFF DMA Controller 0x44000 0x44FFF DataStreamer TLB (Translation Lookaside Buffer) which performs cachingmechanism of address translation tables same as general purposeprocessors. Multimedia processor 100 includes three TLBs for twoclusters and a data streamer.

When bit 18 has a value of 0, the PIO address belongs to transfer engine702. Table 11, illustrates how bits 17:0 are interpreted for transferengine 702 internal operations. TABLE 11 Transfer Engine Decodes BITNAME Description 18 Transfer Engine 1 = NOT transfer engine PIO selectoperation, see table above. 0 = transfer engine PIO operation. 17:12Channel Number Channel number 0 to 63 is selected by this field 11:9Unused  8:6 TE internal 0 = Channel state memory 1 regions and user 1 =Channel state memory 2 interface calls 2 = Reorder table 3 = ds_kick -start a data transfer operation 4 = ds_continue 5 = ds_check_status 6 =ds_freeze 7 = ds_unfreeze  5:0 Address select The user-interface callsare aliased withn TE to all addresses within their region regions

When bit 18 has a value of 1, the PIO address belongs to data streamerbuffer controller 706, relating to buffer state memory, as shown inTable 12. TABLE 12 Data Streamer Buffer Controller Decodes BIT NAMEDescription 63:19 PIO region PIO device select is obtained forspecification and DS the Data Streamer device select 18:12 DS internalcomponent 1000010 select 11 BSM select 0 => BSM1 1 => BSM 2 10:0Register select Select one 64 bit register in each buffer

The internal structure of each component of data streamer 122 inaccordance with one embodiment of the invention is described in moredetail hereinafter.

Transfer Engine

FIG. 8 illustrates a block diagram of transfer engine 702 in accordancewith one embodiment of the invention, although the invention is notlimited in scope in that respect. The main elements of transfer engine702 comprise an operation scheduler 742, coupled to a fetch stage 744,which in turn is coupled to a generate and update stage 746, which iscoupled to write-back stage 748. Together, components 742 through 748define the transfer engine's execution pipeline. A round-robin priorityscheduler 740 is employed to select the appropriate channels and theircorresponding channel state memory.

As will be explained in more detail later, information relating to thechannels that are ready to be executed are stored in channel statememory 704, which is physically divided to two channel state memorybanks 704 (a) and 704 (b) in accordance with one embodiment of theinvention. Priority scheduler 740 performs a round-robin scheduling ofthe ready channels with 4 priority levels. To this end, ready channelswith the highest priority level are picked in a round-robin arrangement.Channels with lower priority levels are considered only if there are nochannels with a higher priority level.

Priority scheduler 740 picks a channel once every two cycles andpresents it to the operation scheduler for another level of scheduling.

Operation scheduler 742 is configured to receive four operations at anytime and execute each operation one at a time. These four operationsinclude a programmable input/output, PIO, operation from theprogrammable input/output controller, PIOC, 126; an incoming descriptorprogram from data transfer switch interface 718; a chunk request for achannel from a chunk request interface queue filled by data streamerbuffer controller 706; and a ready channel from priority scheduler 740.

As will be explained in more detail below in reference with FIGS. 13 and14 a source descriptor program defines the specifics of a data transferoperation to buffer memory 714, and a destination descriptor programdefines the specifics of a data transfer operation from buffer memory714 to a destination location. Furthermore, a buffer issues a chunkrequest for a corresponding source channel stored in channel statememory 704 to indicate the number of bytes that it can receive. Thepriority order with which the operation scheduler picks a task, fromhighest to lowest is PIO operations incoming descriptors; chunkrequests, and ready channels.

Information about the operation that is selected by operation scheduleris transferred to fetch stage 744. The fetch stage is employed toretrieve the bits from channel state memory 704, which are required tocarry out the selected operation. For example, if the operationscheduler picks a ready channel, the channel's chunk count bits andburst size must be read to determine the number of requests that must begenerated for a data transfer operation.

Generate and update stage 746 is executed a number of times that isequal to the number of requests that must be generated for a datatransfer operation as derived from fetch stage 744. For example, if thedestination channel's transfer burst size is 4, then generate and updatestage 746 is executed for 4 cycles, generating a request per cycle. Asanother example, if the operation is a PIO write operation to channelstate memory 704, generate and update stage is executed once. As will beexplained in more detail below, the read/write requests generated bygenerate and update stage 746 are added to a request queue RQQ 764, indata transfer switch interface 718.

Channel state memory 704 needs to be updated after most of theoperations that are executed by transfer engine 702. For example, when achannel completes generating requests in the generate and update stage746, the chunk numbers are decremented and written back to channel statememory 704. Write back stage 748 also sends a reset signal to channelstate memory 704 to initialize the interburst delay counter with theminimum interburst delay value as will be explained in more detail inreference with channel state memory structure illustrated in Table 13.

Channel State Memory

Information relating to each one of the 64 channels in data streamer 122is stored in channel state memory 704. Prior and during a data moveoperation, data streamer 122 employs the data in channel state memory704 for accomplishing its data movement tasks. Tables 13-19, illustratethe fields that define the channel state memory. The tables also showsthe bit positions of the various fields and the value with which theyshould be initiated when the channel is allocated for a data transfer inaccordance with one embodiment of the invention.

Channel state memory 704 is divided into two portions, 704(a) and 704(b)in accordance with one embodiment of the invention. Channel state memory704 (a) has four 64-bit values referred to as 0x00,0x08,0x10, and 0x18.Channel state memory 704 (b) has three 64 bit values at positions0x00,0x08 and 0x10. TABLE 13 Channel State Memory 1 (OFFSET 0x00) BITNAME INITIALIZED WITH VALUE 15:0 Control xxx (don't cares) 31:16 Countxxx 47:32 Width xxx 63:48 Pitch xxx

TABLE 14 Channel State Memory 1 (OFFSET 0x08) BIT NAME INITIALIZED WITHVALUE 31:0 Data Address xxx (don't cares) 47:32 Burst Size set to numberof DTS requests the channel must attempt to generate each time that itis scheduled. (Larger burst sizes are used to get back -to-back requestsinto the memory controller queues, to avoid SDRAM page miss--inconjunction use high DTS priority with larger burst sizes for higherbandwidth transfers). 63:48 Remaining width xxx count (RCW)

TABLE 15 Channel State Memory 1 (OFFSET 0x10) BIT NAME INITIALIZED WITHVALUE 15:0 Remaining burst 0 count (RBC) 31:16 Remaining chunk 0 count(RCCNT) 35:32 State 0 39:36 Interburst delay Must be initialized.Specify in multiples (IBD) of 8 cycles, i.e., value n => minimum delayof 8n cycles before this channel can be considered for scheduling by thepriority scheduler. 45:40 Buffer id (BID) id of the buffer assigned tothis channel 47:46 DTS command A value that is used on the DTS signal(CMD) lines. bit 47: if set to 1 implies allocate in the dcache, 0implies no-allocate bit 46: if set to 1 implies a PIO address 48Descriptor prefetch 0 buffer valid (DPBV) 49 Descriptor valid 0 (DV)51:50 Channel priority value between 0 and 3 indicating the prioritylevel of the channel 0 => highest priority 3 => lowest priority 52Active Flag (A) 0 53 First descriptor 0 (FD) 54 No more 0 descriptors(NMD) 55 Descriptor type 0 => format 1 1 => format 2 59:56 Interburstdelay 0 count (IDBC) 63:60 Reserved xxx

TABLE 16 Channel State Memory 1 (OFFSET 0x18) BIT NAME INITIALIZED WITHVALUE  7:0 Address- space id asid of the application using this (ASID)channel  8 TLB mode 0 => don't use TLB 1 => use TLB 10:9 DTS priorityset to required DTS priority to use for requests from this channel 0 =>highest 3 => lowest 12:11 Cache mode Access mode on the DTS bit 12:x bit11:1 => coherent 0 => non-coherent 16:13 Way mask way mask for cacheaccesses. A value of 1 => use way bit 13: way 0 in data cache bit 14:way 1 bit 15: way 2 bit 16: way 3 28:17 Buffer address start address ofthe corresponding pointer (BAP) buffer, specifying the full 12 bits. 29Read/Write (RW) 1 => source channel (read) 0 => destination channel(write) 35:30 Buffer start address just as it is set in BSM1 (BSA) 41:36Buffer end address just as it is set in BSM1 (BEA) 42 Valid sense 0

TABLE 17 Channel State Memory 2 (OFFSET 0x00) BIT NAME INITIALIZED WITHVALUE 31:0 Next descriptor address xxx (don't cares) 47:32 Control wordxxx 63:48 Count xxx

TABLE 18 Channel State Memory 2 (OFFSET 0x08) BIT NAME INITIALIZED WITHVALUE 15:0 Width xxx (don't cares) 31:16 Pitch xxx 63:32 Data locationaddress xxx

TABLE 19 Channel State Memory 2 (OFFSET 0x10) BIT NAME INITIALIZED WITHVALUE 31:0 Base address xxx (don't cares) 63:32 New pointer address xxx

The bandwidth of data transfer achieved by a channel is based amongother things on four parameters as follows: internal channel priority;minimum interburst delay; transfer burst size; and data transfer switchpriority. When a path is allocated, these four parameters are consideredby the system. Channel features also include three parameters that thesystem initializes. These include the base address, a cache wayreplacement mask as will be explained in more detail, and descriptorfetch mode bits. These parameters are explained hereinafter.

Channel priority: Data Streamer 122 hardware supports four internalchannel priority levels (0 being highest and 3 lowest). As explained,the hardware schedules channels in a round-robin fashion by order ofpriority. For channels associated with memory-memory transfers it ispreferable to assign equal priorities to both channels to keep the datatransfers at both sides moving along, at equal pace. Preferably, thechannels that are hooked up with high bandwidth I/O devices are set upat lower level priority and channels that are hooked up with lowerbandwidth I/O devices employ higher priority. Such channels rarely jointhe scheduling pool, but when they do, they are almost immediatelyscheduled and serviced, and therefore not locked out for andunacceptable number of cycles by a higher bandwidth, higher prioritychannel.

Minimum interburst delay: This parameter relates to the minimum numberof cycles that must pass before any channel can rejoin the schedulingpool after it is serviced. This is a multiple of 8 cycles. Thisparameter can be used to effectively block off high priority channels orchannels that have a larger service time (discussed in the nextparagraph) for a period of time and allow lower priority channels to bescheduled.

Transfer burst size: Once a channel is scheduled, transfer burst sizeparameter indicates the number of actual requests it can generate on thedata transfer switch, before it is de-scheduled again. For a sourcechannel, this indicates the number of requests it generates for data tobe brought into the buffer. For a destination channel, it is the numberof data packets sent out using the data in the buffer. The larger thevalue of this parameter, the longer the service time for a particularchannel. Each request can ask for a maximum of 32 bytes and send 32bytes of data at a time. A channel stays scheduled generating requestsuntil it either runs out of its transfer burst size count, encounters ahalt bit in a descriptor, there are no more descriptors, or a descriptorneeds to be fetched from memory.

This makes its possible to chain several descriptors together forcomplicated transfer patterns or for those that cannot be describedusing a single descriptor.

2. Descriptor Control Field. The 16 bits of this field are interpretedas follows:

[15:14]—unused

[13]—interrupt the host cpu (on completion of this descriptor)

[12]—interrupt the cpu of multimedia processor 100 (on completion ofthis descriptor)

[11:9]—reserved for software use

[8]—No more descriptor (set when this is the last descriptor in thischain).

[7:4]—data fetch mode (for all the data fetched or sent by thisdescriptor)

[7]: cache mode 0=>coherent, 1=>non-coherent

[6]: 1=>use way mask, 0=>don't use way mask

[5]: 1=>allocate in data cache, 0=>no-allocate in data cache

[4]: 1=>data in PIO space, 0=>not

[3]—prefetch inhibit if set to 1

[2]—halt at the end of this descriptor of set to 1

[1:0]—descriptor format type

00: format 1

01: format 2

10: control descriptor

It is noted that the coherence bit indicates whether the data cacheshould be checked for the presence of the data being transferred in orout. In accordance with a preferred embodiment of this invention it isdesired that this bit is not turned off unless the system has determinedthat the data was not brought into the cache by the CPUs 102 or 104.Turning off this bit results in a performance gain by bypassing cache108 since it reduces the load on the cache and may decrease the latencyof the read or write (by 2-18 cycles, depending on the data

DTS priority: Each request to a request bus arbiter or a memory data busarbiter on the data transfer switch is accompanied by a priority by therequestor. Both arbiters support four levels of priority and thepriority to be used for the transfers by a channel is pre-programmedinto the channel state. Higher priorities are used when it is consideredto be important to get multiple requests from the same channel to beadjacent in the memory controller queue, for SDRAM page hits. (0 ishighest priority and 3 is lowest).

Base address, way mask and descriptor fetch modes: For memory-memorymoves, inputting the data path structure (with hits) is optional. Ifthis is null, the system assumes some default values for the variousparameters. These default values are shown in table below.

When requesting a path for a memory-I/O or I/O-memory, the systemprovides a data path structure. This allows to set the booleans thatwill indicate to the system which transfer will be an I/O transfer andtherefore will not need a channel allocation. For an I/O to memorytransfer, parameters such as buffer size and chunk sizes are morerelevant than for a memory-memory transfer, since it might be importantto match the transfer parameters to I/O device bandwidth requirements.

In accordance with one embodiment of this invention, a data path isrequested in response to a request for a data transfer operation. For asystem that is based on software control a kernel returns a data pathstructure that fills in the actual values of the parameters that wasset, and also the ids of the channel that the application will use tokick them off. If the path involves an I/O device, the buffer id is alsoreturned. This buffer id is passed on by the application to the devicedriver call for that I/O device. The device driver uses this value toready the I/O device to start data transfers to that data streamerbuffer. If the user application is not satisfied with the type(parameters) of the DS path resources obtained, it can close the pathand try again later.

Descriptor Program

Data transfers are based on two types of descriptors, as specified inchannel state memory field as format 1 descriptor and format 2descriptor. In accordance with one embodiment of the invention, a format1 descriptor is defined based on the nature of many data transfers in 3Dgraphic and video image applications.

Typically, as illustrated in FIG. 12, pixel information, is stored atscattered locations in the same arrangement that the pixels are intendedto be displayed. Sometimes it is desired to proceed with a data gatheroperation, where “n” pieces of data or pixels are gathered together fromn locations starting at “start source data location=x” in the memoryspace into one contiguous location beginning at “start destination datalocation=y.” Each piece of data gathered is 10 bytes wide and separatedfrom the next one by 22 bytes (pitch). To enable a transfer asillustrated in FIG. 12, two separate descriptors need to be set up, onefor the source channel that handles transfers from source to buffermemory 714 (FIG. 7), and the other for the destination channel thathandles transfers from the buffer memory to the destination.

FIG. 13 illustrates a data-structure 220 for a format 1 descriptor inaccordance with one embodiment of the invention. The size of descriptor220 is 16 bytes, comprising two 8 byte words. The list below describesthe different fields of the descriptor and how each field is employedduring a data transfer operation.

1. Next Descriptor: The first 32 bits hold the address of anotherdescriptor cache queue fullness, if you choose no-allocate in thecache).

The way mask is employed in circumstances wherein data cache 108 hasmultiple ways. For example in accordance with one embodiment of theinvention, data cache 108 has four ways, with 4 k Bytes in each way.Within the present context, each way in a data cache is defined as aseparate memory space that is configured to store a specified type ofdata. The “use way mask” bit simply indicates whether the way mask is tobe used or not, in all the transactions initiated by the currentdescriptor to the data cache.

The “allocate”, “no allocate” bit is relevant only if the coherent bitis set. Basically, no allocate is useful when the user wants to checkthe data cache for coherence reasons, but does not want the data to endup in the data cache, if it is not already present. Allocate must be setwhen the user wants to pre-load the data cache with some data frommemory before the cpu begins computation.

Table 20 shows the action taken for the different values of the coherentand allocate bits in bits 7:4 of descriptor control field relating todata fetch modes.

Memory Transfer Access Modes TABLE 20 Command - mode Cache hit Cachemiss READ Descriptor and Read from the Read from memory and Source data(like a cpu data cache allocate cache line load) coherently- allocateREAD Descriptor and Read from the Read from memory and Source datacoherently-no- data cache DO NOT allocate allocate cache line READDescriptor and Ignore cache Read data directly from Source data non- thememory and DO coherently-no-allocate NOT allocate cache line WRITEDestination data Write the data Allocate a data cache (like a store)coherently- into the cache line and write the data allocate and set theinto the cache line. No dirty flag. memory transaction for the refilloccurs if the cache recognizes the whole of the cache line is beingoverwritten. Set the dirty flag. WRITE Destination data Write the dataWrite it to memory coherently-no-allocate into the data directly and DONOT cache line and allocate a cache line. set the dirty flag WRITEDestination data Ignore cache Write data into memorynon-coherently-no-allocate and DO Not allocate a cache line.

Returning to the explanation of descriptor, the PIO bit is needed whentransferring data from/to PIO (Programmed I/O) address space. Forexample, data streamer 122 can be used to read the data streamer buffermemory (which lies in PIO address space).

The halt bit is used for synchronizing with data streamer 122 from theuser-level. When set, data streamer 122 will halt the channel when it isdone transferring all the data indicated by this descriptor. The datastreamer will also halt when the “no more descriptors” bit is set.

When a data streamer channel fetches a descriptor and begins itsexecution, it immediately initiates a prefetch of the next descriptor.It is possible for the user to inhibit this prefetch process by settingthe “prefetch inhibit” bit. It is valid only when the halt bit is alsoset. That is, it is meaningless to try to inhibit the prefetch when nothalting.

As illustrated in the following list, not all combinations of the datafetch mode bits are valid. For Example, “allocate” and “use way mask”only have meaning when the data cache is the target and since the datacache does not accept PIO accesses any combination where PIO=1 and(other bit)=1 is not used. PIO coherent use-way-mask allocate space 0 00 1 valid—PIO 1 — — 1 invalid — 1 — 1 invalid — — 1 1 invalid 0 0 0 0valid—non-coherent 0 1 — — invalid 0 — 1 — invalid 1 0 0 0valid—coherent no-allocate 1 0 1 0 valid—coherent allocate 1 1 0 0invalid 1 1 1 0 valid—coherent allocate, masked3. Count: This indicates the number of pieces of data to be transferredusing this descriptor.4. Width: is the number of bytes to be picked up from a given location.5. Pitch: is the offset distance between the last byte transferred tothe next byte. Destination is sequential and hence pitch is 0. Pitch isa signed value which enables the data locations gathered to movebackwards through memory.6. Data Location Address: is the address where the first byte for thisdescriptor can be located. In Example 1, for the source side, this is“x” and for the destination transfer it is “y”. Every data locationaddress used by a channel is first added to a base address. This baseaddress value is held in the channel's state memory. When a channel isinitialized by the ds_open_path ( ) call, this base address value is setto zero. This value can be changed by the user using the Controldescriptor (described below).

Table 21 below shows how the descriptors for the source and destinationtransfers are configured, for a data transfer from SDRAM 128 into datacache 108, i.e., a cache pre-load operation.

The control word at the source indicates coherent data operation, butdoes not allocate. The halt bit is not set since there are no moredescriptors, and the channel automatically halts when done transferringthis data. The “No more descriptor” bit must be set. TABLE 21 SourceDescriptor Source Descriptor Bits Explanation  0:31 next descriptor 0only one descriptor 34:47 count n 48:63 control word 0x0100 format 1,no-allocate, coherent, no more descriptors 64:79 pitch +22 80:95 width10 96:127 data address x

The control word for the destination descriptor in table 22 indicatesthat the data cache is the target by making a coherent reference thatshould allocate in the cache if it misses. As for the source case, thehalt bit is not set since the channel will automatically halt when it isdone with this transfer, since the next descriptor field is zero. Alsothe “No more descriptor” bit is set as for the source case. TABLE 22Destination Descriptor Destination Descriptor Bits Explanations  0:31next descriptor 0 only one descriptor 34:47 count 1 gathered together inone big contiguous piece 48:63 control word 0x0120 format 1, coherent,allocate, no more descriptors 64:79 pitch 0 only one piece 80:95 width10n 96:127 data address yFormat 2 Descriptor

FIG. 14 illustrates a data structure 240 corresponding to a format 2descriptor in accordance with one embodiment of the invention. A datamovement operation in accordance with a format 2 descriptor is similarto format 1 descriptor operation in many aspects. However, onedifference with the format 1 descriptor structure is that a unique datalocation address is supplied for each data block intended to betransferred. Furthermore, the data structure in accordance with format 2descriptor does not employ a pitch field. Format 2 descriptor isemployed in data transfer operations when it is desired to transferseveral pieces of data that are identical in width, but which are notseparated by some uniform pitch.

Accordingly, the first field in format 2 descriptor contains the nextdescriptor address. The count field contains the number of data piecesthat are intended to be transferred. The control field specification isidentical to that of format 1 descriptor as discussed in reference withFIG. 13. The width field specifies the width of data pieces that areintended to be transferred. In accordance with one embodiment of theinvention, format 2 descriptors are aligned to a 16 byte boundary forcoherent accesses and 8 byte boundary for non-coherent accesses. Thelength of a format 2 descriptor varies from 16 bytes to multiples of 4bytes greater than 16.

Data Transfer Switch Interface

FIG. 9 illustrates a block diagram of data transfer switch (DTS)interface 718 in accordance with one embodiment of the invention,although the invention is not limited in scope in that respect. It is tobe understood that a data transfer switch interface is employed by allcomponents of multimedia processor 100 that transfer data via datatransfer switch 112 (FIG. 1(a)).

DTS interface 718 includes a bus requester 760 that is coupled torequest bus 118 of data transfer switch 112. Bus requester 760 comprisesa request issuer 762 which is configured to provide request signals to oa request bus queue (RQQ) 764. Request bus queue 764 is afirst-in-first-out FIFO buffer that holds data and descriptor requestson a first come first served basis.

The other input port of request bus queue 764 is configured to receiveread/write requests generated by transfer engine 702 via generate andupdate stage 746. Read requests include requests for data and forchannel descriptors. Write requests include requests for data being sentout.

Issuer 762 is configured to send a request signal to data transferswitch request bus arbiter 140. When granted, bus requester 760 sendsthe request contained at the top of first-in-first-out request queue764. A request that is not granted by data transfer switch request busarbiter 140, after a few cycles, is removed from the head of requestqueue 764 and re-entered at its tail Thus, the data transfer operationavoids unreasonable delays when a particular bus slave or responder isnot ready. As mentioned before, requests to different responderscorrespond to different channels. Thus, the mechanism to remove arequest from the queue is designed in accordance with one embodiment ofthe invention so that one channel does not hold up all other channelsfrom making forward progress.

Data transfer switch interface also includes a receive engine 772, whichcomprises a processor memory bus (PMB) receive FIFO buffer 776, a PMBreorder table 778, an internal memory bus (1 MB) receive FIFO 774 and an1 MB reorder table 780. An output port of PMB receive FIFO buffer 776 iscoupled to data switch buffer controller (DSBC) 706 and to operationscheduler 742 of transfer engine 702. Similarly, an output port of IMBreceive FIFO 774 is coupled to data switch buffer controller 706 and tooperation scheduler 742 of transfer engine 702. An output port of issuer762 is coupled to an input port of processor memory bus (PMB) reordertable 778, and to an input port of internal memory bus (IMP) reordertable 780. Another input port of PMB reorder table 778 is configured toreceive data from data bus 114. Similarly, another input port of IMBreorder table 780 is configured to receive data from data bus 120.

Processor memory bus (PMB) reorder table 778 or internal memory bus (1MB) reorder table 780 respectively store indices that correspond to readrequests that are still outstanding. These indices include a transactionidentification signal (ID) that is generated for the read request, thecorresponding buffer identification signal (ID) assigned for each readrequest, the corresponding buffer address and other information that maybe necessary to process the data when it is received.

First-in-first-out buffers 776 and 774 are configured to hold returneddata until it is accepted by either the data streamer buffer controller706, for the situation where buffer data is returned, or by transferengine 702 for the situation where a descriptor is retrieved from amemory location.

Issuer 762 stalls when tables 778 and 780 are full. This in turn maystall transfer engine 702 pipes. In accordance with one embodiment ofthe invention tables 778 and 780 each support 8 outstanding requests perbus. By using tables that store the buffer address for the return data,it is possible to handle out-of-order data returns. As will be explainedin more detail in reference with the data streamer buffer controller,each byte stored in buffer memory 714 includes a valid bit indicationsignal, which in conjunction with a corresponding logic in the buffercontroller assures that out-of-order returns are handled correctly.

Data transfer switch interface 718 also includes a transmit engine 782,which comprises a processor memory bus (PMB) transmit engine 766 and aninternal memory bus (IMB) transmit engine 770, both of which arefirst-in-first-out FIFO buffers. A buffer 768 is configured to receiverequest signals from transmit engines 766 and 770 respectively and tosend data bus requests to data bus arbiters 140 and 142 respectively.Each transmit engine is also configured to receive data from datastreamer buffer controller 706 and to transmit to corresponding databuses.

During operation, when the request to request bus 118 is for read data,issuer 762 provides the address to request bus 118 when it receives agrant from request bus arbiter 140. Issuer 762 also makes an entry inreorder tables 778 and 780 respectively, to keep track of outstandingrequests. If the request is for write data, the issuer puts out theaddress to request bus 118 and queues the request into internal FIFObuffer 716 (FIG. 7) for use by data streamer buffer controller 706,which examines this queue and services the request for write data aswill be explained hereinafter in more detail in reference with datastreamer buffer controller 706.

FIG. 10 is a block diagram of data streamer buffer controller 706 inaccordance with one embodiment of the invention, although the inventionis not limited in scope in that respect. Data streamer buffer controller706 manages buffer memory 714 and handles read/write requests generatedby transfer engine 702, and request generated by DMA controller 138 andPIO controller 126 of FIG. 1.

Data streamer buffer controller 706 includes two pipes for processingbuffer related functions. The first processing pipe of data streamerbuffer controller 706 is referred to as processor memory bus, (PMB),pipe, and the second pipe is referred to as internal memory bus (IMB)pipe. The operation of each pipe is the same except that the PMB pipehandles the transfer engine's data requests that are sent out onprocessor memory bus 114, and the 1 MB pipe handles the transferengine's data requests that are sent out on internal memory bus 120.

As illustrated in FIG. 10, each pipe is configured to receive threeseparate data inputs. To this end data streamer buffer controller 706includes a processor memory bus PMB pipe operation scheduler 802, whichis configured to receive three input signals as follows: (1) all requestsignals from programmable input/output (PIO) controller 126; (2) datasignals that are received from processor memory bus (PMB), receive FIFObuffer 776 of data transfer switch 718 (FIG. 9)—These data signals areintended to be written to buffer memory 714, so as to be retrieved oncean appropriate chunk size is filled inside buffer memory 714 for aparticular channel; and (3) transfer engine read signal indication forretrieving appropriate data from buffer memory 714 for a particularchannel. The retrieved data is then sent to its destination, via datatransfer switch interface 718 of data streamer 122, as illustrated inFIGS. 1 and 9.

Operation scheduler 802 assigns an order of execution to incomingoperation requests described above. In accordance with one embodiment ofthe present invention, programmable input/output PIO operations aregiven top priority, followed by buffer read operations to retrieve datafrom buffer memory 714, and the lowest priority is given to buffer writeoperations to write data to buffer memory 714. Thus, read operationsbypass write operations in appropriate FIFO buffers discussed inconnection with FIG. 9. It is noted that when data is targeted to adestination memory, or has arrived from a destination memory, it needsto be aligned before it can be sent from buffer memory 714 or before itcan be written into buffer memory 714.

The output port of operation scheduler 802 is coupled to an input portof fetch stage 804. The other input port of fetch stage 804 is coupledto an output port of buffer state memory 708.

Once the operation scheduler 802 determines the next operation, fetchstage 804 retrieves the appropriate buffer memory information frombuffer state memory 708 so as to read or write into the correspondingchannel buffer, which is a portion of buffer memory 714.

An output port of fetch stage 804 is coupled to memory pipe stage 806,which is configured to process read and write requests to buffer memory714. Memory pipe stage 806 is coupled to buffer state memory 708 so asto update buffer state memory registers relating to a correspondingbuffer that is allocated to one or two channels during a data transferoperation. Memory pipe stage 806 is also coupled to buffer memory 714 towrite data into the buffer memory and to receive data from the buffermemory. An output port of memory pipe stage 806 is coupled to processormemory bus (PMB) transmit engine 766 so as to send retrieved data frombuffer memory 714 to data transfer switch 718 for further transmissionto a destination address via data transfer switch 112. Another outputport of memory pipe stage 806 is coupled to programmable input/output(PIO) controller 126 for sending retrieved data from buffer memory 714to destination input/output devices that are coupled to multimediaprocessor 100.

Data streamer buffer controller 706 also includes an internal memory bus(1 MB) pipe operation scheduler 808, which is configured to receivethree input signals as follows: (1) all request signals from DMAcontroller 712; (2) data signals that are received from internal memorybus (IMB), receive FIFO buffer 774 of data transfer switch 718 (FIG.9)—These data signals are intended to be written to buffer memory 714,so as to be retrieved once an appropriate chunk size is filled insidebuffer memory 714 for a particular channel; and (3) transfer engine readsignal indication for retrieving appropriate data from buffer memory 714for a particular channel. The retrieved data is then sent to itsdestination, via data transfer switch interface 718 of data streamer122, as illustrated in FIGS. 1 and 9.

Operation scheduler 808 assigns an order of execution to incomingoperation requests described above. In accordance with one embodiment ofthe present invention, DMA requests are given top priority, followed bybuffer read operations to retrieve data from buffer memory 714, and thelowest priority is given to buffer write operations to write data tobuffer memory 714. Thus, read operations bypass write operations inappropriate FIFO buffers discussed in connection with FIG. 9. It isnoted that when data is targeted to a destination memory, or has arrivedfrom a destination memory, it needs to be aligned before it can be sentfrom buffer memory 714 or before it can be written into buffer memory714.

The output port of operation scheduler 808 is coupled to an input portof fetch stage 810. The other input port of fetch stage 810 is coupledto an output port of buffer state memory 708. Once the operationscheduler 802 determines the next operation, fetch stage 804 retrievesthe appropriate buffer memory information from buffer state memory 708so as to read or write into the corresponding channel buffer, which is aportion of buffer memory 714.

An output port of fetch stage 810 is coupled to memory pipe stage 812,which processes read and write requests to buffer memory 714. An outputport of memory pipe stage 812 is coupled to an input port of bufferstate memory 708 so as to update buffer state memory registers relatingto a corresponding buffer that is allocated to one or two channelsduring a data transfer operation. Memory pipe stage 812 is coupled tobuffer memory 714 to write data into the buffer memory and to receivedata from the buffer memory. An output port of memory pipe stage 812 iscoupled to internal memory bus (1 MB) transmit engine 770 so as to sendretrieved data from buffer memory 714 to data transfer switch 718 forfurther transmission to a destination address via data transfer switch112. Another output port of memory pipe stage 812 is coupled to DMAcontroller 712 for sending retrieved data from buffer memory 714 todestination input/output devices that are coupled to multimediaprocessor 100.

It is noted that because buffer memory 714 is dual-ported, each of thepipes described above can access both buffer memory banks 714(a) and 714(b), without contention. As mentioned before, in accordance with oneembodiment of the invention, buffer memory 714 is a 4 KB SRAM memory.The data array is organized as 8 bytes per line and is accessed 8 bytesat a time. A plurality of smaller buffer portions are divided within thebuffer memory 714, wherein each buffer portion is allocated to aparticular channel during a data transfer operation.

Buffer memory 714 is accompanied by a valid bit memory that holds 8 bitsper line of 8 bytes in the buffer memory. The value of the valid bit isused to indicate whether the specific byte is valid or not. The validbit is flipped each time the corresponding allocated buffer is filled.This removes the need to reinitialize the allocated buffer portion eachtime it is used during a data transfer operation. However, each time abuffer is allocated for a path, the corresponding bits in the valid-bitsarray must be initialized to zeroes.

Buffer State Memory

As explained before, buffer state memory 708 holds the state for each ofthe 64 buffers that it supports. Each buffer state comprises 128 bitfield that is divided to couple of 64 bit sub fields, referred to asbuffer state memory one (BSM1) and two (BSM2). Tables 23 and 24 describethe bits and fields of the buffer state memory. TABLE 23 BUFFER STATEMEMORY 1 (0x00) BIT NAME INITIALIZED WITH VALUE 11:0 Initial Initializedto the buffer start address. input That is, the full 12 bits, comprisingthe pointer 6 bits of the buffer start address (BSA) appended with 6zeros [BSA][000000] 23:12 Initial Initialized to the buffer startaddress output similar to the initial output pointer. pointer 29:24Buffer end Initialize with 6 bits of the higher 6 bits 35:30 addressthat comprise the full 12 bits of the buffer (BEA) address for it's endand start address Buffer start respectively, i.e., specified inmultiples address of 64 bytes. The actual buffer start address (BSA) isobtained by appending 6 zeros to the buffer start address and the endaddress is obtained by appending 6 ones to the buffer end address.Example 1: for a buffer of size 64 bytes starting at the beginning ofthe buffer BSA = 000000 BEA = 000000 actual start address is000000000000 actual end address is 000000111111 Example 2: for a bufferof size 128 bytes starting 64*11 bytes from the beginning of the bufferBSA = 001011 BEA = 001100 actual start address is 001011000000 actualend address is 001100111111 41:36 Output Specify in multiples of 32bytes. Is the number chunk size of bytes that must be brought into thebuffer by the input channel or input i/o device before the output(destination) channel is activated to transfer “output chunk size”number of bytes out of the buffer. 0 => 0 bytes 1 => 32 bytes 2 => 64bytes, and so on. 47:42 Input Similar to output chunk size, but used tochunk trigger the input (or source) channel, when size input chunk sizenumber of bytes have been moved out of the buffer. 53:48 Output Valuebetween 0 and 63, representing the channel output (destination) channeltied to this id buffer, if one exists, as indicated by the outputchannel memory flag. 59:54 Input Value between 0 and 63, representingthe input channel (source) channel tied to this buffer, if one idexists, as indicated by the input channel memory flag. 60 Output Used toindicate whether this transfer channel direction is represented by achannel or an memory I/O device. 0 => I/O, 1 => channel. flag 61 InputUsed to indicate whether this transfer direction channel is representedby a channel or an I/O device. memory 0 => I/O, 1 => channel. flag 63:62reserved xx

Buffer State Memory2 (0X00) TABLE 24 BIT NAME INITIALIZED WITH VALUE11:0 Current input count 0 23:12 Current output count 0 24 Input validsense 0 25 Output valid sense 0 26 Last input arrived 0 63:27 reservedxxxDMA Controller

FIG. 11 illustrates a DMA controller 138 in accordance with oneembodiment of the invention, although the invention is not limited inscope in that respect. As mentioned before, DMA controller 138 iscoupled to input/output bus 132 and data streamer buffer controller 706.

A priority arbiter 202 is configured to receive a direct memory accessDMA request from one or more I/O devices that are coupled to I/O bus132.

An incoming DMA request buffer 204 is coupled to I/O bus 132 and isconfigured to receive pertinent request data from I/O devices whoserequest has been granted. Each I/O device specifies a request datacomprising the buffer identification of a desired buffer memory, thenumber of bytes and the type of transfer, such as input to the buffer oroutput from the buffer. Each request is stored in incoming DMA request204 buffer to define a DMA request queue. An output port of DMA requestbuffer 204 is coupled to data streamer buffer controller 706 asdescribed in reference with FIG. 10.

An incoming DMA data buffer 206 is also coupled to I/O bus 132 and isconfigured to receive the data intended to be sent by an I/O devicewhose request has been granted and whose request data has been providedto incoming DMA request buffer 204. An output port of DMA data buffer206 is coupled to data streamer buffer controller 706 as described inreference with FIG. 10.

An outgoing DMA data buffer 208 is also coupled to I/O bus 132 and isconfigured to transmit the data intended to be sent to an I/O device.Outgoing DMA data buffer 208 is configured to receive data from datastreamer buffer controller 706 as explained in reference with FIG. 10.

Thus during operation, DMA controller 138 performs two importantfunctions. First, it arbitrates among the I/O devices that intend tomake a DMA request. Second, it provides buffering for DMA requests anddata that are sent to data streamer buffer controller and for data thatare sent to an I/O device via I/O bus 132. Each DMA transfer isinitiated by an I/O device coupled to I/O bus 132. The I/O device thatmakes a DMA request, first requests priority arbiter 202 to access I/Obus for transferring its intended data. Arbiter 202 employs the DMApriority value specified by the I/O device to arbitrate among thedifferent I/O devices. DMA controller 138 assigns a higher priority todata coming from I/O devices over data sent from the I/O devices.Conflicting requests are arbitrated according to device priorities.

Preferably, device requests to DMA controller 138 are serviced at a rateof one per cycle, fully pipelined. Arbiter 202 employs a round robinpriority scheduler arrangement with four priority levels. Once arequesting I/O device receives a grant signal from arbiter 202, itprovides its request data to DMA request buffer 204. If the request isan output request, it is provided directly to data streamer buffercontroller 706. If the buffer associated with the buffer identificationcontained in request data is not large enough to accommodate the datatransfer, data streamer buffer controller informs DMA controller 138,which in turn signals a not acknowledge NACK indication back to the I/Odevice.

If the request from a request I/O device is for a data input, DMAcontroller signals the I/O device to provide its data onto I/O bus 132,when it obtains a cycle on the I/O data bus. Data streamer buffercontroller generates an interrupt signal when it senses buffer overflowsor underflows. The interrupt signals are then transmitted to theprocessor that controls the operation of multimedia processor 100.

DMA controller 138 employs the buffer identification of each request toaccess the correct buffer for the path, via data streamer buffercontroller 706, which moves the requested bytes into or out of thebuffer and updates the status of the buffer.

An exemplary operation of data streamer channel functions is nowexplained in more detail in reference with FIGS. 15(a) through 15(c),which illustrate a flow diagram of different steps that are taken indata streamer 122.

In response to a request for a data transfer operation, a channel'sstate is first initialized by, for example, a command referred to asds_open_path, at step 302. At step 304, the available resources forsetting up a data path is checked and a buffer memory and one or twochannels are allocated in response to a request for a data transferoperation.

At step 306 the appropriate values are written into buffer state memory708 for the new data path, in accordance with the values described inreference with Tables 23 and 24. At step 308, valid bits are reset inbuffer memory 714 at locations corresponding to the portion of theallocated data RAM that will be used for the buffer. At step 310, foreach allocated channel corresponding channel state memory locations areinitialized in channel state memory 704, in accordance with Tables13-19.

Once a data path has been defined in accordance with steps 302 through310, the initialized channel is activated in step 312. In accordancewith one embodiment of the invention, the activation of a channel may bea software call referred to as a ds_kick command. Internally, this calltranslates to a channel ds_kick operation which is an uncached write toa PIO address specified in the PIO map as explained in reference withTables 10-12. The value stored in channel state memory is the address ofthe descriptor, such as descriptor 220 (FIG. 13) or descriptor 240 (FIG.14), the channel begins to execute.

At step 314 transfer engine 702 receives the channel activation signalfrom PIO controller 126 and in response to this signal writes thedescriptor address into a corresponding location in channel state memory704. At step 316, transfer engine 702 determines whether the channelactivation signal is for a source (input to buffer) channel. If so, atstep 318, the buffer size value is written in the remaining chunk count(RCCNT) field as illustrated in Table 15. The value of the remainingchunk count for a source channel indicates the number of empty spaces inthe buffer memory allocated for this data transfer and hence the numberof bytes that the channel can safely fetch into the buffer. It is notedthat the value of the remaining chunk count for a destination channelindicates the number of valid bytes in the buffer, and hence the numberof bytes that the channel can safely transfer out.

Finally, at step 320, transfer engine 702 turns on the active flag inthe corresponding location in channel state memory as described in Table15. The corresponding interburst delay field in channel state memory 704for an allocate source channel is also set to zero.

At step 324, a channel is provided to operation scheduler 742 (FIG. 8).Each channel is considered for scheduling by operation scheduler 742 oftransfer engine 702 (FIG. 8), when the channel has a zerointerburst-delay count, its active flag is turned on, and itscorresponding remaining chunk count (RCCNT) is a non-zero number.

When a channel's turn reaches by scheduler 742, transfer engine 702starts a descriptor fetch operation at step 326. When the descriptorarrives via the data transfer switch interface 718 (FIG. 9), receiveengine 772 routes the arrived descriptor to transfer engine 702. At step328, the values of the descriptor are written in the allocated channellocation in channel state memory 704. At step 330 the source channel isready to start to transfer data into the allocated buffer in buffermemory 714.

When the source channel is scheduled, it begins to prefetch the nextdescriptor and at step 332 generates read request messages for data,which are added to request buffer queue RQQ 764 of data transfer switchinterface 718 of FIG. 9. It is noted that in accordance with oneembodiment of the invention, the prefetch of the next descriptor may beinhibited by the user by setting both the halt and prefetch bits in thecontrol word descriptor as described in reference with FIGS. 13 and 14.Furthermore, prefetch is not performed when a “last descriptor” bit isset in the control word of the current descriptor.

The number of read requests added to request queue 764 depends onseveral parameters. For example, one such parameter is the burst sizevalue written into the channel state, memory for the currently servicedchannel. A burst size indicates the size of data transfer initiated byone request command. Preferably, the number of requests generated perschedule of the channel does not exceed the burst size. Anotherparameter is the remaining chunk count. For example, with a burst sizeof 3, ff, the buffer size is 64 bytes, and therefore, two requests maybe generated, since each data transfer switch request may not exceed 32bytes, in accordance with one embodiment of the invention. Anotherparameter is the width, pitch, and count fields in the descriptor. Forexample, if the width is 8 bytes separated by a pitch of 32 bytes, for acount of 4, then, with a burst size of 3, and a remaining chunk countRCCNT of 64, the channel will generate 3 read requests of 8 bytes long.Then it will take another schedule of the channel to generate the lastrequest that would fulfill the descriptor's need for the forth count.

Once the channel completes its read requests, at step 334, the value ofremaining chunk count is decremented appropriately. The interburst delaycount field is set to a specifiable minimum interburst delay value. Thisfield is decremented every 8 cycles at step 338. When the value of thisfield is zero at step 340, the channel is scheduled again to continueits servicing.

At step 342 the channel is scheduled again. For the example describedabove, the channel generates one request to fulfill the 1st 8 bytes. Oncompletion of the descriptor at step 344, the active flag is turned offand the channel is not considered again by the priority scheduler 740until the active flag field in Table 15 is set again, for example by adata path continue operation command referred to as ds_continue call. Ifthe halt bit is not set, at step 346, the channel will check whether theprefetched descriptor has been arrived. If the descriptor has alreadyarrived, it will copy the prefetched descriptor to the current positionin step 350, and start the prefetch of the next descriptor at step 352.

Transfer engine 702 continues to generate read requests for this channeluntil, burst size has been exceed; remaining chunk count RCCNT has beenexhausted; a halt bit is encountered; the next descriptor has notarrived yet; or the last descriptor has been reached.

Referring to FIG. 15(a) at step 316, when the currently consideredchannel is a destination channel, step 380 is executed wherein thechannel is not immediately scheduled like a source channel, because thevalue of the remaining chunk count field is zero. The destinationchannel waits at step 382 until the source side has transferred asufficient number of data to its allocated buffer. As explained before,the data source that provides data to the allocated buffer may beanother channel or an input/output I/O device. It is noted that datastreamer buffer controller 706 (FIG. 10) keeps track of incoming data.When the number of bytes of the incoming data exceeds the output chunkcount as described in Table 23, it sends the chunk count to transferengine 702 (FIG. 8) for that destination channel. Transfer engine 702adds this value to the destination channel's RCCNT field in theappropriate channel location in channel state memory 704. At step 384,when this event happens, the destination channel is ready to bescheduled. Thereafter at step 386, transfer engine 702 generates writerequests to data transfer switch 112 via data transfer switch interface718.

The manner in which write requests are generated are based on the sameprinciple described above with reference to the manner that readrequests are generated in accordance with one embodiment of theinvention. Thus, the parameters to be considered may include, the burstsize, the remaining chunk count value, and descriptor fields such aspitch, width and count.

Once the write request address has been provided to the request bus,data transfer switch interface 718 forwards the request to data streamerbuffer controller 706 at step 388. In response, data streamer buffercontroller 706 (FIG. 10) removes the necessary number of bytes frombuffer memory 714, aligns the retrieved data and puts them back intransmit engine 782 of FIG. 9 as described above, in reference withFIGS. 8-10.

Data Cache

The structure and operation of data cache 108 in accordance with oneembodiment of the invention is described in more detail hereinafter,although the invention is not limited in scope to this embodiment.

FIG. 17 illustrates a block diagram of data cache 108 coupled to amemory bus 114′. It is noted that memory bus 114′ has been illustratedfor purposes of the present discussion. Thus, in accordance with oneembodiment of the invention, data cache 108 may be coupled to datatransfer switch 112, and hence, to processor memory bus 114 and internalmemory bus 120 via transceiver 116.

Data cache 108 includes a tag memory directory 536 for storing tag bitsof addresses of memory locations whose contents are stored in the datacache. A data cache memory 538 is coupled to tag memory 536 to storecopies of data that are stored in a main external memory. Both tagmemory directory 536 and data cache memory 538 are accessible viaarbiters 532 and 534 respectively. An input port of each tag memory 536and data cache memory 538 is configured to receive “write” data asdescribed in more detail below. Furthermore, another input port of eachtag memory 536 and data cache memory 538 is configured to receive “read”data as described in more detail below.

A refill controller unit 540 also referred to as data cache controller540 is employed to carry out all of a fixed set of cache policies. Thecache policies are the rules chosen to implement the operation of cache108. Some of these policies are well-known and described in J. Handy,Data Cache Memory Book, (Academic Press, Inc. 1993), and incorporatedherein by reference. Typically, these policies may include direct-mappedvs. N-Way caching, write-through vs. write-back arrangement, line sizeallocation and snooping.

As described above a “way” or a “bank” in a cache relates to theassociativity of a cache. For example, an N-way or N-bank cache canstore data from a main memory location into any of N cache locations.For a multiple-way arrangement each way or bank includes its own tagmemory directory and data memory (not shown). It is noted that as thenumber of the ways or banks increases so does the number of bits in thetag memory directory corresponding to each data stored in the datamemory of each bank. It is further noted that a direct-mapped cache is aone-Way cache, since any main memory location can only be mapped intothe single cache location which has matching set bits.

The snoop feature relates to the process of monitoring the traffic inbus 114′ to maintain coherency. In accordance with one embodiment of theinvention, a snoop unit 544 is coupled to memory bus 114′ to monitor thetraffic in bus 114′. Snoop unit 544 is coupled to both refill controller540 and to external access controller 542. When a memory bus transactionoccurs to an address which is replicated in data cache 108, snoop unit544 detects a snoop hit and takes appropriate actions according to boththe write strategy (write-back or write-through) and to the coherencyprotocol being used by the system. In accordance with one embodiment ofthe invention, data cache 108 performs a snoop function on data transferoperations performed by data streamer 122.

Returning to the description of refill controller 540, an output port ofthe refill controller is coupled to tag memory 536 and data memory 538via arbiters 532 and 536 respectively. Another output port of refillcontroller 540 is coupled to the write input port of tag memory 532.Another output port of refill controller 540 is coupled to the writeinput port of cache data memory 538.

Other output ports of refill controller 540 include bus request portcoupled to memory bus 114′ for providing bus request signals; write-backdata port coupled to memory bus 114′ for providing write-back data whendata cache 108 intends to write the contents of a cache line into acorresponding external memory location; fill data address port coupledto memory bus 114′ for providing the data address of the cache linewhose contents are intended for an external memory location.

An input port of refill controller 540 is configured to receive datasignals from a read output port of data memory 516. A second input portof refill controller 540 is configured to receive tag data from tagmemory directory 532. Another input port of refill controller 540 isconfigured to receive a load/store address signal from an instructionunit of a central processing unit 102.

In accordance with one embodiment of the invention, data cache 108 alsoincludes an external access controller 542. External access controller542 allows data cache 108 function as a slave module to other modules inmedia processor system 100. Thus, any module in system 100 may act as abus master for accessing data cache 108, based on the same accessprinciple performed by central processing unit 102.

An output port of external access controller 542 is coupled to tagmemory 536 and cache data memory 538 via arbiters 532 and 534respectively, and to the write input port of tag memory 536. Anotheroutput port of external access controller 542 is coupled to the writeinput port of cache data memory 538. Finally, an output port of externalaccess controller 542 is coupled to memory bus 114′ for providing thedata requested by a bus master.

An input port of external access controller 542 is configured to receivedata from cache data memory 538. Other input port of external accesscontroller 542 include an access request port coupled to memory bus 114′for receiving access requests from other bus masters; a requested dataaddress port coupled to memory bus 114′ for receiving the address of thedata relating to the bus master request; and a store data port coupledto memory bus 114′ for receiving the data provided by a bus master andthat is intended to be stored in data cache 108.

Memory bus 114′ is also coupled to DRAM 128 via a memory controller 124.Furthermore memory bus 114′ is coupled to a direct memory accesscontroller 138. An output port of central processing unit 102 is coupledto tag memory 536 and cache data memory 538 via arbiters 532 and 534respectively, so as to provide addresses corresponding to load and storeoperations. Another output port of central processing unit 102 iscoupled to the write input port of cache data memory 538 to provide datacorresponding to a store operation. Finally, an input port of centralprocessing unit 102 is coupled to read output port of cache data memory538 to receive data corresponding to a load operation.

The operation of refill controller 540 is now described in referencewith FIG. 18. At step 560 refill controller begins its operation. Atstep 562, refill controller 540 determines whether a request made todata cache unit 108 is a hit or a miss, by comparing the tag value withthe upper part of a load or store address received from centralprocessing unit 102.

At step 564, if a cache miss occurred in response to a request, refillcontroller 540 goes to step 568, and determines the cache line thatneeds to be replaced with contents of corresponding memory locations inexternal memory such as DRAM 128. At step 570, refill controllerdetermines whether cache 108 employs a write-back policy. If so, refillcontroller 540 provides the cache line that is being replaced to DRAM128 by issuing a store request signal to memory controller 124. At step572, refill controller 540 issues a read request signal for the missingcache line via fill data address port to memory controller 124. At step574, refill controller 540, retrieves the fill data and writes it incache data memory 538 and modifies tag memory 536.

Refill controller 540 then goes to step 576 and provides the requesteddata to central processing unit 102 in response to a load request. Inthe alternative, refill controller 540 writes a data in cache datamemory 538 in response to a store request from central processing unit102. At step 578, refill controller 540 writes the data to externalmemory, such as DRAM 128 in response to a store operation provided bycentral processing unit 102.

If at step 564, it is determined that a hit occurred in response to aload or store request from central processing unit 102, refillcontroller 540 goes to step 566 and provides a cache line from cachedata memory 538 for either a read or a write operation. Refillcontroller 540 then goes to step 576 as explained above.

The operation of external access controller 580 in conjunction withrefill controller 540 in accordance with one embodiment of the presentinvention is now described in reference with FIG. 19.

At step 580 external access controller begins its operation in responseto a bus master access request. In accordance with one embodiment of theinvention, the bus master may be any one of the modules described abovein reference with FIG. 1(a), and the access request may be issued asexplained in connection with the operation of data streamer 122 and datatransfer switch 112. At step 582 external access controller 542 waitsfor a read or write request by any of the bus masters.

Once external access controller 542 receives a request, it goes to step584 to determine whether the bus master has requested a read or a writeoperation. If the request is a read, external access controller 542 goesto step 586 to determine whether a hit or a miss occurred. If inresponse to the read request a cache hit occurs, external accesscontroller goes to step 604 and provides the requested data to the busmaster.

If however, in response to the read request a cache miss occurs,external access controller goes to step 588 and triggers refillcontroller 540 so that refill controller 540 obtains the requested dataand fills the data cache at step 590. After the refill of data, externalaccess controller 542 provides the requested data to the bus master atstep 604.

If at step 584 external access controller determines that the bus masterrequested to write a data to data cache 108, it goes to step 592 todetermine whether a cache hit or a cache miss occurred. In response to acache hit, external access controller 542 goes to step 596 and allowsthe bus master to write the requested data to data cache memory 538.

If at step 592, however, a cache miss occurred, external accesscontroller goes to step 594 and determines which cache line in cachedata memory needs to be replaced with contents of an external memorysuch as DRAM 128. External access controller then goes to step 598. Ifdata cache 108 is implementing a write-back-policy, external accesscontroller at step 598 provides the cache line to be replaced from datacache memory 538 and issues a store request to memory controller 124 viamemory bus 114′.

Thereafter, external access controller 542 goes to step 602 and writesthe requested data to cache data memory and modifies tag memory 536accordingly.

As mentioned before the external access controller 542 remarkablyincreases the cache hit ratio for many applications where it is possibleto predict in advance the data that a central processing unit mayrequire. As an example, for many 3D graphic applications, informationabout texture mapping is stored in an external memory such as DRAM 128.Because, it can be predicted which information will be necessary for theuse by central processing unit 102, it is beneficial to transfer thisinformation to data cache 108 before the actual use by centralprocessing unit 102. In that event, when the time comes that centralprocessing unit 102 requires a texture mapping information, thecorresponding data is already present in the data cache and as a resulta cache hit occurs.

Three Dimensional (3D) Graphics Processing

With reference to FIG. 1(a), fixed function unit 106 in conjunction withdata cache memory 108, central processing units 102, 104, and externalmemory 128, perform 3D graphics with a substantially reduced bandwidthdelays in accordance with one embodiment of the invention, although theinvention is not limited in scope in that respect.

FIG. 20 illustrates a block diagram with major components in multimediaprocessor 100 that are responsible for performing 3D graphicsprocessing. Thus, in accordance with one embodiment of the invention,fixed function unit 106 includes a programmable input/output controller618, which provides a control command for other components in the fixedfunction unit. The other components of the fixed function unit includesa VGA graphics controller 603, which is coupled to programmableinput/output controller, PIOC, 618 and which is configured to processgraphics for VGA format. A two dimensional (2D) logic unit 605 iscoupled to programmable input/output controller, and is configured toprocess two-dimensional graphics.

Fixed function unit 106 also includes a three dimensional (3D) unit 611that employs a bin-based rendering algorithm as will be described inmore detail hereinafter. Basically, in accordance with one embodiment ofthe invention, the 3D unit manipulates units of data referred to aschunks, tiles, or bins. Each tile is a small portion of an entirescreen. Thus, the 3D unit in accordance with one embodiment of theinvention, preferably employs a binning process to draw 3D objects intoa corresponding buffer memory space within multimedia processor 100.Thus, bottle necking problems encountered with the use of externalmemory for rendering algorithms can be substantially avoided because thedata transfer within the multimedia processor chip can be accomplishedat a substantially high bandwidth.

3D unit 611 includes a 3D tile rasterizer 607 that is also coupled toprogrammable input/output controller 618, and is configured to performgraphics processing tasks. Two major tasks of 3D tile rasterizer 607include binning and rasterization, depending on its mode of operation,as will be explained in more detail in reference with FIGS. 21 and 22.

3D unit 611 also includes a 3D texture controller 609, which is alsocoupled to and controlled by programmable input/output controller 618.As will be explained in more detail, in reference with FIG. 23, 3Dtexture controller derives the addresses for the texels that areintended to be employed by 3D unit 611. Thus, based on the derivedaddresses, 3D texture controller 609 generates a channel descriptor foruse by data streamer 122 to obtain the appropriate texels from a localmemory such as SDRAM 128, as described above in reference with theoperation of data streamer 122.

3D unit 611 also includes a 3D texture filter unit 610, which is coupledto and controlled by programmable input/output controller 618. As willbe explained in more detail hereinafter, in reference with FIGS. 24 and25, filter unit 610 is configured to perform texture filteringoperations such as bi-linear (1 pass) and tri-linear (2 pass)interpolation, in conjunction with shading color blending andaccumulation blending.

Fixed function unit 106 includes a video scaler unit 612 that is coupledto and controlled by programmable input/output controller 618. Videoscaler unit 612 is configured to provide up and down scaling of videodata using several horizontal and vertical taps. Video scaler 612provides output pixels to a display refresh unit 226 (FIG. 1(b)) fordisplaying 3D objects on a display screen. As will be explained in moredetail, in accordance with one embodiment of the invention, some of thefunctions of texture filter are based on the same principles as thefunctions of the video scaler. As such, video scaler 612 shares some ofits functions with texture filter 610, in accordance with one embodimentof the invention.

Fixed function unit 106 includes a data transfer switch interface 614that allows different components of the fixed function unit interactwith data transfer switch 112 and data streamer 122. Data transferswitch interface 614 operates based on the same principles discussedabove in reference with data transfer switch interface 718 asillustrated in FIG. 9. A data cache interface 616 allows fixed functionunit 106 have access to data cache unit 108.

FIG. 20 illustrates various components of data cache 108 that arerelated to 3D graphics processing operation in accordance with oneembodiment of the invention. However, for purposes of clarity, otherfeatures and components of data cache 108 as discussed in reference withFIGS. 16-19 have not been illustrated in FIG. 20. Furthermore, althoughthe components of data cache 108 have been illustrated to be disposedwithin the data cache, it is to be understood that one or morecomponents may be disposed as separate cache units in accordance withother embodiments of the invention.

Data cache 108 includes a triangle set-up buffer 620, which isconfigured to store results of calculations to obtain triangleparameters, such as slopes of each edge of a triangle. Data cache 10also includes a rasterizer set-up buffer 622, which is configured tostore additional parameters of each triangle, such as screencoordinates, texture coordinates, shading colors, depth, and theirpartial differential parameters. Data cache 108 includes a depth tilebuffer, also referred to as tile Z buffer 628 that stores all the depthvalues of all the pixels in a tile.

Data cache 108 also includes a refill controller 540 and an externalaccess controller 542, as discussed above in reference with FIGS. 17-19.Furthermore, central processing units 102,104 are coupled to data cache108 as described above in reference with FIG. 1(a). Additionalcomponents illustrated in FIG. 20 include data transfer switch 112, datastreamer 122, memory controller 124 and SDRAM 128, as disclosed anddescribed above in reference with FIGS. 1-15. I/O bus 132 is configuredto provide signals to a display refresh unit 226, which provides displaysignals to an image display device, such as a monitor (not shown). Inaccordance with one embodiment of the invention, video scaler 612 iscoupled directly to display refresh 226.

As will be explained in more detail below, the geometry and lightingtransformations of all triangles on a screen are performed by VLIWcentral processing units 102 in accordance with one embodiment of theinvention. 3D unit 611 is responsible to identify all the bins or tilesand all the triangles that intersect with each tile. Specifically, 3Dtriangle rasterizer 607 identifies all the triangles in each tile.Thereafter for each bin or tile, VLIW central processing units 102perform a triangle set-up test to calculate the parameters of eachtriangle such as slope of the edges of each triangle. 3D trianglerasterizer 607 also rasterizes all the triangles that intersect witheach bin or tile. 3D texture controller 607 calculates the textureaddresses of all pixels in a bin or a tile.

Once the addresses of texels are obtained, data streamer 122 obtains thecorresponding texel information from SDRAM 128. 3D texture filter 610performs bi-linear and tri-linear interpolation of fetched texels. Datastreamer 122 thereafter writes the processed image data of each tile orbin into a frame buffer. Thus, the frame buffer defines an array in DRAM128 which contains the intensity/color values for all pixels of animage. The graphics display device can access this array to determinethe intensity/color at which each pixel is displayed.

FIG. 21 is a block diagram of 3D triangle rasterizer 607 in accordancewith one embodiment of the invention. For purposes of clarity, FIG. 21illustrates the signal flows that occur when 3D triangle rasterizer 607is operating in a binning mode as will be explained in more detailbelow.

Data cache 108 is coupled to 3D triangle rasterizer 607 so as to providethe information necessary for the binning operation. Two of the buffersin data cache 108 that are employed during the binning operation areset-up buffer 622 and tile index buffer 630.

3D triangle rasterizer 607 includes a format converter unit 632 which isconfigured to receive triangle set up information from data cache 108.Format converter unit 532 converts the parameters received from datacache 108 from floating point numbers to fixed point numbers. A screencoordinates interpolator 634 is in turn coupled to format converter 632,to provide the x,y coordinates of the pixels that are being processed by3D triangle rasterizer 607. A binning unit 644 is configured to receivethe x,y coordinates from interpolator 634 and perform a binningoperation as described in more detail in reference with FIG. 26. Thebinning unit is also coupled to tile index buffer 630. Informationcalculated by binning unit 644 is provided to a tile data buffer 646within memory 128, via data streamer 122.

During operation, 3D triangle rasterizer 607 reads the screencoordinates of each node or vertex of a triangle, taken as an input fromdata cache 108. Thereafter, the triangle rasterizer identifies alltriangles that intersect each bin or tile, and composes data structurescalled tileindex and tiledata as an output in SDRAM 128.

As mentioned, before a rasterization phase begins, all triangles of anentire screen are processed for geometry and lighting. Setup andrasterization are then repeatedly executed for each bin or tile. Binninginvolves the separation of the output image up into equal size squares.In accordance with one embodiment of the invention, the size of each binor tile is a square area defined by 16×16 pixels. Each square israsterized and then moved to the final frame buffer. In order for a binto be correctly rasterized, the information relating to all of thetriangles that intersect that bin should be preferably present. It isfor this purpose that setup and rasterization data for all the trianglesin a screen are first obtained prior to the binning process.

Binning involves the process of taking each pixel along the edges of atriangle and identify all the bins that the pixels of a triangle belongto Thus, the process begins by identifying the pixel representing thetop vertex of a triangle and thereafter moving along the left and rightedges of the triangle to identify other pixels that intersect withhorizontal scan lines, so as the corresponding bins where the pixelsbelong to are obtained. Once the bins are identified an identificationnumber, or triangle ID, corresponding to the triangle that is beingprocessed is associated with the identified bins.

Tile index buffer 630, is preferably a 2 dimensional array thatcorresponds to the number of bins on a screen that is being processed.This number is static for a given screen resolution. Thus, tile indexbuffer 630 includes an index to the first triangle ID in tile databuffer 646. The tile data buffer is a static array of size 265 K inlocal memory, in accordance with one embodiment of the invention. Tiledata buffer 646 contains a triangle index, and a pointer to the nexttriangle. Thus, by following the chain, all the triangles for a givenbin can be found, in accordance with one embodiment of the invention.

FIG. 26 illustrates the operation of a binning process on an exemplarytriangle, such as 861, in accordance with one embodiment of theinvention, although the invention is not limit in scope in that respect.Triangle 861 is divided into 2 sub-triangles with a horizontal linedrawn through the middle node or vertex B. As illustrated in FIG. 26,triangle 861 spans several pixels both in the horizontal and verticaldirection, which define a triangle window. Binning unit 644 spans thesepixels line by line. Thus, at step 862, binning unit 644 processes theline that includes the top vertex a of the triangle. During the span,the x coordinate of the left-most pixel is Ax or Cross XAC and the xcoordinate of the right-most pixel is Ax or Cross XAB. Cross XAC is thex coordinate of the cross point between the edge AC and the next span,and, Cross XAB is the x coordinate of the cross point between the edgeAB and the next span. In order to extract the bins in which these pixelsbelong, binning unit 644 employs the conditionX=[min 2Ax, Cross XAC), max 2(Ax, Cross XAB)], wherein X is thex-coordinate range of the triangle for each scanline.

At step 864, binning unit 644 employs the conditionX=[min 2(CrossXAC, CrossXAC+dxdy AC), max 2 (CrossXAB, CrossXAB+dxdyAB)]

The x coordinate of each cross point between the edges AC and AB of thefollowing span is derived byCrossXAC=Cross XAC+dxdyACCrossXAB=CrossXAB+dxdyABwherein dxdyAC is the slope of the edge AC of triangle 861, and dxdyABis the slope of the edge AB of triangle 861. Step 864 repeats till thespan includes the middle vertex B. Thereafter binning unit 644 goes tostep 866.

At step 866, the x coordinate of the right-most pixel is the maximum ofthree parameters, such thatX=[min 2(Cross XAC, Cross XAC+dxdyAC), max 3(Cross XAB, Bx, Cross XBC)],wherein CrossXBC is the x coordinate of the cross point between BC andthe next span. Thereafter, binning unit 644 performs step 868, bycontinuing to add Cross XAC and Cross XBC with dxdyAC and dxdyBC untilthe spans include the bottom vertex C, such thatX={min 2(Cross XAC, Cross XAC+dxdyAC), Max 2(Cross XBC,CrossXBC+dxdyBC)},andCrossXAC=CrossXAC+dxdyACCrossXBC=CrossXBC+dxdyBC.

Finally at step 870, binning unit 644 identifies the bins wherein thelast pixels belong such thatX=[min 2(Cross XAC, Cx), max 2(Cross XBC, Cx)].

During the above steps 862 through 870, binning unit 644 stores the IDsof all the bins which the pixels in the edges of each triangle belongto. As a result of the binning process for all triangles displayed in ascreen, tile index buffer 630 and tile data buffer 646 are filled. Thisallows 3D unit 611 to retrieve the triangles which cross over a bin wheneach bin or tile is processed as explained hereinafter.

FIG. 22 illustrates 3D triangle rasterizer 607 in a rasterization mode.It is noted that the data structures employed during the rasterizationmode can re-use the memory of data cache 108, where the tile indexbuffer 630 was employed during the binning mode. Thus, prior torasterization, the contents of tile index buffer 630 is written to localmemory DRAM 128.

3D triangle rasterizer 607 includes a texture coordinates interpolator636 which is coupled to format converter 632, and which is configured toobtain texture coordinate data of pixels within a triangle by employingan interpolation process. A color interpolator 618 is coupled to formatconverter 632, and is configured to obtain color coordinates of pixelswithin a triangle by employing an interpolation method.

A depth interpolator 640 is also coupled to format converter 632, and isconfigured to obtain the depth of the pixels within a triangle. It isimportant to note that in accordance with one embodiment of theinvention, when a bin is being rendered it is likely that the triangleswithin a bin are in overlapping layers. Layer is a separable surface indepth from another layer. 3D triangle rasterizer 607 processes thelayers front to back so as to avoid rasterizing complete triangles insucceeding layers. By rasterizing only the visible pixels, considerablecalculation and processing may be saved. Thus, rasterizer 607 sorts thelayers on a bin by bin basis. Because the average number of triangles ina bin is around 10, the sorting process does not take a long time. Thissorting occurs prior to any triangle set-up or rasterization inaccordance with one embodiment of the invention.

It is noted that preferably the triangles in a bin are not sorted juston each triangle's average depth or Z value. For larger triangles, depthinterpolator 640 obtains the Z value of the middle of the triangle.Z-valid register 642 is coupled to depth interpolator 642 to track thevalid depth values to be stored in a depth tile buffer 628 in data cache108 as described below.

As illustrated in FIG. 22, the buffers employed in data cache 108 duringrasterization mode are fragment index 650, rasterizer set-up buffer 622,texture coordinate tile (tile T) 624, color tile (tile C) 626 and depthtile (tile Z) 628. Fragment index 650 is coupled to a fragment generator648, which provides fragments which are employed for anti-aliasing or ablending.

Fragment generator 648 is coupled to four buffer spaces in memory 128including fragment link buffer 652, texture coordinate of fragmentbuffer 654, color of fragment buffer 656 and depth of fragment buffer658. The operation of these buffers in memory is based on the sameprinciple as will be discussed in reference with corresponding buffersin data cache 108. Rasterizer set-up buffer 622 is coupled to formatconverter 632 so as to provide the triangle parameters that arenecessary for the rasterization process to complete. Furthermore,texture coordinate tile 624 is coupled to texture coordinateinterpolator 636. Similarly, color tile 626 is coupled to colorinterpolator 638, and depth tile 628 is coupled to depth interpolator640. Depth tile 628 holds the valid depth values of each triangle in abin that is being processed.

Thus, during operation 3D triangle rasterizer 607 reads triangle set-updata corresponding to the vertex of each triangle, including screencoordinates, texture coordinates, shading colors, depth and theirpartial differentials, dR/dX, dR/dY, etc. from data cache rasterizesset-up buffer 622. For these differentials, for example, R is redcomponent of shading color and dR/dX means the difference of R formoving 1 pixel along x-direction. dR/dY means the difference of R formoving 1 pixel along y-direction. Using these set-up parameters, 3Dtriangle rasterizer 607 rasterizes inside of a given triangle byinterpolation. By employing the Z-buffering only the results of visibletriangles or portions thereof are stored in texture coordinate tile 624and color tile 626. Thus, the Z value of each pixel is stored in tile628. The Z value indicates the depth of a pixel away from the user'seyes. Thus, the Z values indicate whether a pixel is hidden by anotherobject or not.

As a result, texture coordinate tile 624 stores texture-relatedinformation such as a texture map address and size, and texturecoordinates for a tile. Texture coordinates are interpolated by texturecoordinate interpolator 636 as a fixed point number and stored intexture coordinate tile 624 in the same fixed point format. Similarly,color tile 626 defines a data structure that stores RGBA shading colorsfor visible pixels. Thus, the texture and color information providedafter the rasterization relates to visible pixels in accordance with oneembodiment of the invention.

FIG. 23 illustrates a block diagram of a 3D texture controller 609 thatis employed to generate texel addressed in accordance with oneembodiment of the invention. 3D texture controller includes a formatconverter 632, coupled to a memory address calculator 664. The outputport of memory address calculator is coupled to an input port of atexture cache tag check unit 666, which in turn is coupled to an addressmap generator 668 and a data streamer descriptor generator 670. 3Dtexture controller 609 is coupled to data cache 108.

Data cache 108 employs address map buffer 660, texture coordinate tile624 and color tile 662 during the texture address generation asperformed by 3D texture controller 609. Thus, address generator 668provides address maps to address map buffer 660 of data cache 108.Furthermore, texture coordinate tile 624 provides the texturecoordinates that were generated during the rasterization process tomemory address calculator 664. Color tile 662 also provides color datato memory address calculator 664.

In response to the information provided by data cache 108, 3D texturecontroller 609 calculates memory addresses of necessary texels. Then, 3Dtexture controller 609 looks up cache tag 666 to check if the texel isin a predetermined portion of data cache 108 referred to as texturecache 667. If the cache hits, 3D Texture controller 609 stores the cacheaddress into another data structure on the data cache 108 referred to asaddress map 660. Otherwise, 3D texture controller stores the missingcache line address as a data streamer descriptor so that data streamer122 can move the line from memory 128 to texture cache 667. Address map660 is also written during the cache-miss condition.

The data stored in address map 660 is employed at a later stage duringtexel filtering. Thus, address map buffer 660 is employed to indicatethe mapping of texel addresses to pixels. The array stored in addressmap buffer 660 is a static array for the pixels in a bin and contains apointer to the location in the buffer for the pixel to indicate which4×4 texel block is applicable for a given pixel. The type of filterrequired is also stored in address map buffer 660.

FIG. 24 illustrates 3D texture filter 610 in accordance with oneembodiment of the invention. 3D texture filter 610 includes a texelfetch unit 942 that is configured to receive texel information fromaddress map buffer 660. Information received by texel fetch unit 942 isin turn provided to texture cache 667 to indicate which texels intexture cache 667 need to be filtered next.

3D texture filter 610 also includes a palettize unit 944, which isconfigured to receive texels from texture cache 667. When the value intexture cache indicates the index of the texel colors, palletize unit944 gets the texel color with the index from the table located in datacache. The output port of palettize unit 944 is coupled to a horizontalinterpolator 946, which in turn is coupled to a vertical interpolator948. Both horizontal interpolator 946 and vertical interpolator 948 areconfigured to receive coefficient parameters from address map buffer660. The output port of vertical interpolator 948 is coupled to atri-linear interpolator 950, which receives a coefficient parameter fromcolor tile 622 for the first pass of interpolation and receives acoefficient parameter from a color buffer 930 for the second pass ofinterpolation.

It is noted that there are two kinds of coefficients in accordance withone embodiment of the invention. One coefficient is used for bi-linearinterpolation and indicates how the weight of four neighborhood-texelcolors are interpolated. The other coefficient is used for tri-linearinterpolation, and indicates how the weight of two bi-linear colors areinterpolated.

The output port of interpolator 950 is coupled to a shading color blendunit 952. Shading color blend unit 952 is also configured to receivecolor values from color tile 622. An output port of shading color blendunit 952 is coupled to color tile 622, and to accumulation blend unit954. The output port of accumulation blend unit 954 is coupled to aninput port of an accumulation buffer 934 that resides in data cache 108in accordance with one embodiment of the invention.

During operation, 3D texture filter 610 performs bi-linear texturefiltering. Input texels are read from texture cache 667 by employingmemory addresses stored in address map buffer 660. The result ofbi-linear filtering is blended with shading color in color tile 622 andwritten back into color tile 622 as a final textured color. When anaccumulation is specified, the final color is blended into anaccumulated color in accumulation buffer 934.

In order to perform tri-linear filtering two passes are required. In thefirst pass, 3D texture filter output bi-linear filtered result stored incolor buffer 930. In the second pass, it generates the final tri-linearresult by blending the color stored in color buffer 930 with anotherbi-linear filtered color.

The contents of palettize unit 944 is loaded from data cache 108 byactivating 3D texture filter 610 in a set palette mode.

Bi-linear and tri-linear filtering employ a process that obtains theweighted sum of several neighboring texels. In accordance with oneembodiment of the invention, a texel data is obtained by employing avertical interpolation followed by a horizontal interpolation ofneighboring texels. For example, the number of vertical texels may be 3and the number of horizontal texels may be 5. Filtering is performedusing specifiable coefficients. Thus, a filtering process is defined asthe weighted sum of 15 texels and the final output T for a filteredtexel is defined as follows:Tx=k11 Txy+k12Txy+1+k13Txy+2Tx+1=k21 Tx+1y+k22Tx+1y+1=k23Tx+1y+2Tx+2=k31Tx+2y+k32Tx+2y+1+k33Tx+2y+2Tx+3=k41Tx+3y+k42Tx+3y+1+k43Tx+3y+2Tx+4=k51Tx+4y+k52Tx+4y+1+k53Tx+4y+2Toutput=kaTx+kbTx+1+kcTx+2+kdTx+3+kcTx+4wherein T is a texel information corresponding to a fetched texel. It isnoted that when the interpolation point is within the same grid as theprevious one, there is no need to perform vertical interpolation inaccordance with one embodiment of the invention. This follows becausethe result of vertical interpolation is the same as one of a previouscomputations. On the other hand, even the texel is within the same gridas the previous one, recalculation of the horizontal interpolation isnecessary, because the relative position of the scaled texel on the gridmay be different, thus the coefficient set is different.

Thus, as illustrated above, the core operation for texel filtering ismultiplication and addition. In accordance with one embodiment of theinvention, these function may be shared with multiplying and addingfunctions of video scaler 612 as illustrated in FIGS. 25 a and 25 b.

FIG. 25 a illustrates a block diagram of video scaler 612 in accordancewith one embodiment of the present invention. Video scaler 612 includesa bus interface 820 which is coupled to processor memory bus 114, andwhich is configured to send requests and receive pixel informationtherefrom. A fixed function memory 828 is coupled to bus interface unit820 and is configured to receive YCbCr pixel data from memory 128 byemploying data streamer 122. Fixed function memory 828 stores apredetermined portion of pixels that is preferably larger than a portionthat is necessary for interpolation so as to reduce the traffic betweenmemory 128 and video scaler 612.

A source image buffer 822 is coupled to fixed function memory 828, andis configured to receive pixel data that is sufficient to perform aninterpolation operation. Pixel address controller 826 generates theaddress of pixel data that is retrieved from fixed function memory 828,for interpolation operation A vertical source data shift register 824 iscoupled to source image buffer 822 and is configured to shift pixel datafor multiply and add operation that is employed during an interpolationprocess. It is noted that when video scaler 612 is performing afiltering operation for 3D texture filter 610, vertical source datashift register 824 is configured to store and shift appropriate texeldata for the multiply and add operation.

A horizontal source data shift register 830 is configured to storeintermediate vertically interpolated pixels, as derived by multiply andadd circuit 834. The data in horizontal data shift register 830 can beused again for multiplication and adding operation.

A coefficient storage unit 844 is configured to store prespecifiedcoefficients for interpolation operation. Thus, when video scaler 612 isperforming a filtering operation for 3D texture filter 610, coefficientstorage unit 844 stores filtering coefficients for texels, and, whenvideo scaler 612 is performing a scaling operation, coefficient storageunit 844 stores interpolation coefficients for pixels.

A coordinate adder 846 is coupled to a selector 840 to control theretrieval of appropriate coefficients for the multiply and addoperation. Coordinate adder 846 is in turn coupled to an x,y baseaddress, which correspond to the coordinates of a starting pixel, ortexel. A Δ unit 850, is configured to provide the differential forvertical and horizontal directions for the coordinates of a desiredscaled pixel on the non-scaled original pixel plane.

Multiply and add unit 834 is configured to perform the multiply and addoperations as illustrated in FIG. 25 b in accordance with one embodimentof the invention, although the invention is not limited in scope in thatrespect. Thus, multiply and add unit 834 comprises a plurality of pixeland coefficient registers 852, and 854, which are multiplied bymultiplier 856 to generate a number via adder 860.

An output pixel first-in-first-out FIFO buffer 842 is configured tostore the derived pixels for output to a display refresh unit, such as226, or to data cache 108, depending on the value of a correspondingcontrol bit in video scaler control register.

During operation, in accordance with one embodiment of the invention,video scaler 612 reads YCbCr pixel data from memory 128 using datastreamer 122, and places them in fixed function memory 828. Thereafter,appropriate bits corresponding to Y, Cb, Cr pixel data are read fromfixed function memory 828 using pixel address controller 826. Theretrieved data is written into three source image buffer spaces insource image buffer 822 corresponding to Y, Cb and Cr data. Whenvertical source data shift registers have empty space, source imagebuffer 822 provides a copy of its data to vertical source data shiftregisters. For vertical interpolations, intermediate verticallyinterpolated pixels are stored in horizontal source data shift register830.

The sequence for vertical and horizontal interpolations depends on thescaling factor. In accordance with one embodiment of the invention,there are three multiply and add units 834 in video scaler 612 so thatthree vertical and three horizontal interpolations can be performedsimultaneously.

FIG. 27 is a flow chart summarizing the steps involved in 3D graphicsprocessing as discussed in connection with FIGS. 20-26. Thus, at step880, VLIW processor 102 calculates geometry data by calculating screencoordinates, colors and binning parameters for all triangles inside aframe. At step 882 fixed function unit is activated for binning byproviding binning indication signal to 3D triangle rasterizer 607. As aresult of binning, tile index and tile data for all bins are calculatedat step 884.

At step 886, for all bins in a flame set-up and interpolation forvisible pixels within triangles begins. Thus, VLIW 102 calculatestriangle set-up data at step 888. At step 890, 3D triangle rasterizercalculates parameters for rendering including x,y,z, RGBA, [s,t, and w]for each pixel in a triangle, by activating 3D triangle rasterizer 607in interpolation mode at step 892. The s, t, and w parameters arehomogeneous texture coordinates and are employed for, what is know as,perspective correction. Homogeneous texture coordinates indicate whichtexel does a pixel correspond with.

For all pixels in a bin VLIW 102 calculates texture coordinates for eachpixel in response to s,t, w calculations obtained by 3D trianglerasterizer 607. At step 896 3D texture controller 609 calculates thetexture addresses. At step 898 data streamer 122 fetches texels frommemory 128 in response to calculated texture addresses. It is noted thatwhile data streamer 122 is fetching texels corresponding to a bin, VLIWprocessor 102 is calculating texture coordinates u,v corresponding to afollowing bin. This is possible because of the structure of data cache108 which allows access to cache by fixed function unit in accordancewith one embodiment of the invention.

At step 900, video scaler 612 is activated in conjunction with 3Dtexture filter 610 to perform texel filtering on a portion of fetchedfilters.

In accordance with one embodiment of the invention at steps 902 through912 3D graphics unit performs anti-aliasing and a blending for allpixels in a fragment based on the same principles discussed inconnection with steps 894 through 900. At step 914 the data derived byfixed function unit is stored in a flame buffer, by employing datastreamer 122 to transfer data to a local memory space, such as one inSDRAM 128.

Thus, the present invention allows for a binning process by employingdata cache in a multimedia processor, and storing corresponding datarelating to each bin in the data cache. Furthermore, in accordance withone aspect of the invention, before fetching texels, the visible pixelsof a triangle are first identified and thus, only corresponding texelsare retreived from a local memory.

While only certain features of the invention have been illustrated anddescribed herein, many modifications, substitutions, changes orequivalents will now occur to those skilled in the art. It is therefore,to be understood that the appended claims are intended to cover all suchmodifications and changes that fall within the true spirit of theinvention.

1. (canceled)
 2. In an information processing system, having a pluralityof modules including a processor, a cache memory, a main memory and aplurality of I/O devices, a data streamer for performing data transferoperations between said modules comprises: a transfer engine configuredto execute memory transfer operations; and a channel state memory,coupled to said transfer engine, said channel state memory configured tostore at least one first source descriptor corresponding to a memorytransfer operation, said first source descriptor including a location ofdata to be transferred from a source module as well as a designatedcache memory, wherein said transfer engine reads said first sourcedescriptor from said channel state memory, said data transfer engineretrieving said data from said source module indicated in said firstsource descriptor and transferring said data to said cache memorydesignated by said first source descriptor.
 3. A system as claimed inclaim 2, wherein said channel state memory is configured to store asecond destination descriptor, said second destination descriptorincluding the location of the data in said cache as well as the identityand location of a destination module, wherein said data transfer enginereads said second destination descriptor and transfers said data fromsaid cache to said destination module.
 4. A system as claimed in claim2, wherein said descriptors maintain a next descriptor field configuredto store the address of a second descriptor for use in said datatransfer operation.
 5. A system as claimed in claim 2, wherein said datacache maintains a plurality of ways, said ways being defined as separatememory spaces within said data cache for storing a specified type ofdata, wherein said first descriptor includes a way mask field thatindicates whether or not the way mask, defining a specific way forstorage of data with said cache, is to be used during said data transferoperation.
 6. A system as claimed in claim 2, wherein said descriptormaintains a PIO bit configured to store the programmed I/O addressspace.
 7. A system as claimed in claim 2, wherein said first descriptormaintains a halt bit configured to store information concerning when thechannel serving said data transfer operation will be halted when all ofthe data is transferred.
 8. A system as claimed in claim 2, wherein saidfirst source descriptor may be of a one of two types, wherein a firsttype of descriptor uses a pitch filed and does not include a unique datalocation address for each data block intended to be transferred, but asecond type of descriptor does not use a pitch field and does include aunique data location address for each data block intended to betransferred.
 9. A system as claimed in claim 8, wherein said first typeof first source descriptor is used for data transfer operations that aretransferring data that are not identical in width but are separated by auniform pitch.
 10. A system as claimed in claim 9, wherein said secondtype of first source descriptor is used for data transfer operationsthat are transferring data that are identical in width but are notseparated by a uniform pitch.